Timeline for Maximize points of K dance moves
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 11, 2017 at 7:37 | vote | accept | Waley Chen | ||
| Mar 8, 2017 at 15:29 | comment | added | spektr | @WaleyChen I have added a second part to my answer which should hopefully be simpler to understand, especially since there is some pseudo-code. | |
| Mar 8, 2017 at 15:28 | history | edited | spektr | CC BY-SA 3.0 |
added 3413 characters in body
|
| Mar 7, 2017 at 20:36 | comment | added | spektr | @WaleyChen No worries. I can try to write it in psuedo-code/code later in terms of for loops, it isn't as complicated as it appears, I promise. A book I recommend for Dynamic Programming is Dynamic Programming and Optimal Control by Bertsekas. You could just get Volume I to get up to speed (try checking his site to see if he has a free PDF of it). | |
| Mar 7, 2017 at 20:24 | comment | added | Waley Chen | Sorry, I've read the solution multiple times and it seems like it's just way over my head. Don't think math is my strong suit. Could you explain it simpler (perhaps with code)? Or could you recommend resources to help me build the skill to be able to solve these kind of problems? | |
| Mar 7, 2017 at 19:09 | history | answered | spektr | CC BY-SA 3.0 |