數塔
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 21496 Accepted Submission(s): 12929
有如下所示的數塔,要求從頂層走到底層,若每一步只能走到相鄰的結點,則經過的結點的數字之和最大是多少?
已經告訴你了,這是個DP的題目,你能AC嗎?
#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int C,N,i,j;
int a[110][110];
scanf("%d",&C);
while(C--)
{
scanf("%d",&N);
for(i=1;i<=N;i++)
for(j=1;j<=i;j++)
scanf("%d",&a[i][j]);
for(i=N-1;i>=1;i--)
for(j=1;j<=i;j++)
{
if( a[i+1][j] > a[i+1][j+1] )
a[i][j]+=a[i+1][j];
else
a[i][j]+=a[i+1][j+1];
}
printf("%d\n",a[1][1]);
}
return 0;
}