How is Problem D — Memory and Scores solved using Dynamic Programming?

Revision en1, by thecortex, 2016-09-13 00:15:10

How is problem [problem:712D]solved using Dynamic Programming?

What is the memoization array structure?

What is the base case?

What is the greedy choice equation?

Thanks in advance!

Tags dp, dynamic programming

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English thecortex 2016-09-13 00:15:25 3 Tiny change: 'blem:712D]solved usi' -> 'blem:712D] solved usi'
en1 English thecortex 2016-09-13 00:15:10 263 Initial revision (published)