DP Made Easy

Consider a 2 dimensional minimum Dynamic Programming problem represented as DP[i][j]. Initially we are given N quadratic functions of the form ƒi(x) = ai*x2 + bi*x1 + ci, where ai >= bi >= ci >= 0. - Transition of the DP in 1st dimension is given as some transition pairs with a cost associated with it. For example, given i one can transit to v1, v2, v3 ... vx with cost w1, w2, w3 ... wx respect