DP Table Method

[cyberdragon]

I can't understand DP table Method especially with it's memory saving tricks.
Need help with references or anything explains it well.

[brianfry713]

http://www.comp.nus.edu.sg/~stevenha/my ... ng/cp1.pdf

[matheusdallrosa]

i had the same problem, but if you see when we close the recurrence formula, we know where to get the things on the table by the parameters of the function on the formula, example:

http://www.geeksforgeeks.org/dynamic-pr ... -distance/

on this formula we need to take the states that are stored on M[ i-1 ][ j ] , M[ i ][ j-1 ] , M[ i-1 ][ j-1 ].

See the knapsack example that you're gonna take it.