菜鸟和大牛 Time Limit: 1000 MS Memory Limit: 65536 K Total Submit: 114(48 users) Total Accepted: 51(45 users) Special Judge: No Description blue和AutoGerk

#include<stdio.h>
#include<string.h>
int a[101][1001],b[101][1001];
int n;
#define max1(a,b) (a>b)?(a):(b);
int max2(int a,int b,int c)
{
b=max1(b,c);
a=max1(a,b);
return a;
}
int dp(int i,int j)
{
if(b[i][j]>=0) return b[i][j];
return b[i][j]=a[i][j]+(i==n-1?0:max2(dp(i+1,j),dp(i+1,j+1),dp(i+1,j+2)));
}
int main()
{
int t,i,j;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<2*(i+1)-1;j++)
scanf("%d",&a[i][j]);
memset(b,-1,sizeof(b));
printf("%d\n",dp(0,0));
}
return 0;
}