Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?
已经告诉你了,这是个DP的题目,你能AC吗?
1 5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5
30
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int t, n, a[110][110], dp[110][110];
scanf("%d", &t);
while (t--)
{
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < i + 1; j++)
scanf("%d", &a[i][j]);
for (int i = 0; i < n; i++)
dp[n - 1][i] = a[n - 1][i];
for (int i = n - 2; i >= 0; i--)
{
for (int j = 0; j < i + 1; j++)
dp[i][j] = max(dp[i + 1][j], dp[i + 1][j + 1]) + a[i][j];
}
printf("%d\n", dp[0][0]);
}
return 0;
}