动态规划探索之 hdu 2084

#include<stdio.h>#include<string.h>int max(int a,int b){if(a>b)return a;else return b;}int main(){int T,t;int i,j;int f[500][500];memset(f,0,sizeof(f));scanf("%d",&T);while(T--){scanf("%d",&t);for(i=1;i<=t;i++)for(j=1;j<=i;j++)scanf("%d",&f[i][j]);for(i=t-1;i>=1;i--)for(j=1;j<=i;j++)f[i][j]+=max(f[i+1][j],f[i+1][j+1]);printf("%d\n",f[1][1]);}return 0;}