POJ1157 LITTLE SHOP OF FLOWERS

F个花，V个花瓶，对应F*V种值，后面的花只能选择前面的花所在花瓶的后面的花瓶，求最大值的总和。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#define MAX(a,b) (a) > (b)? (a):(b)
#define MIN(a,b) (a) < (b)? (a):(b)
#define mem(a) memset(a,0,sizeof(a))
#define INF 1000000007
#define MAXN 105
using namespace std;

int DP[MAXN][MAXN];

int main()
{
    int F,V;
    while(~scanf("%d%d",&F,&V))
    {
        int i,j;
        mem(DP[0]);
        for(i=1;i<=F;i++)
        {
            DP[i][0] = -INF;
            for(j=1;j<=V;j++)
            {
                scanf("%d",&DP[i][j]);
                DP[i][j]=MAX(DP[i][j-1],DP[i][j]+DP[i-1][j-1]);
            }
        }
        printf("%d\n", DP[F][V]);
    }
    return 0;
}