Poj1157 flower shop (Dynamic Planning)

Simple Dynamic Planning is basically the same as that of a backpack. It should be noted that initialization and the original order must be ensured.

# Include <stdio. h> # define INF-999999int F, V; int A [100] [100]; int d [100] [100]; int dp (int f, int V) {If (d [f] [v]! = Inf) {return d [f] [v];} If (F> V) {// return INF;} If (F = V) {// The vase is enough. put int I in order; int result = 0; for (I = 0; I <= V; I ++) {result + = A [I] [I];} d [f] [v] = result; return result;} int x = dp (F-1, v-1) + A [f] [v]; // F put into Vint y = dp (F, v-1); // F do not put vx = x> Y? X: Y; d [f] [v] = x; return X;} int main (void) {scanf ("% d", & F, & V ); int I, j; for (I = 0; I <F; I ++) {for (j = 0; j <v; j ++) {scanf ("% d", & A [I] [J]); D [I] [J] = inf ;}} printf ("% d \ n ", DP (F-1, V-1); Return 0 ;}