hdu 2391 Filthy Rich

题目链接：http://acm.hdu.edu.cn/showproblem.p

#include<stdio.h>#include<string.h>int dp[1010][10101];int max(int a,int b){    return a>b?a:b;}int main(){    int T,icase=1;    scanf("%d",&T);    while(T--)    {        int N,M,i,j;        scanf("%d%d",&N,&M);        for(i=1;i<=M+1;i++)  dp[N+1][i]=0;        for(i=1;i<=N+1;i++)  dp[i][M+1]=0;        for(i=1;i<=N;i++)           for(j=1;j<=M;j++)             scanf("%d",&dp[i][j]);        for(i=N;i>=1;i--)           for(j=M;j>=1;j--)            dp[i][j]+=max(dp[i+1][j+1],max(dp[i+1][j],dp[i][j+1]));        printf("Scenario #%d:\n%d\n\n",icase++,dp[1][1]);    }    return 0;}

hp?pid=2391