题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2084
思路:从上往下推,数越来越多,结果状态太多,不好处理;则由下往上推,越往上数越少,最终归于一个数。(在数塔的最后一层加上n+1个0)
状态方程:dp[i][j] = max(dp[i+1][j], dp[i+1][j+1])+a[i][j];
C++代码实现:
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int dp[102][102], a[102][102];
int main()
{
int C, n, i, j;
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]);
}
}
memset(dp, 0, sizeof(dp));
for(i=n; i>0; i--)
{
for(j=1; j<=i; j++)
{
dp[i][j] = max(dp[i+1][j], dp[i+1][j+1]) + a[i][j];
}
}
printf("%d\n", dp[1][1]);
}
return 0;
}
题目链接:https://www.51nod.com/Challenge/Problem.html#!#problemId=1002
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
#define N 505
int main()
{
int dp[N][N], a[N][N], n, i, j;
scanf("%d", &n);
for(i=1; i<=n; i++)
{
for(j=1; j<=i; j++)
{
scanf("%d", &a[i][j]);
}
}
memset(dp, 0, sizeof(dp));
for(i=n; i>0; i--)
{
for(j=1; j<=i; j++)
{
dp[i][j] = max(dp[i+1][j], dp[i+1][j+1])+a[i][j];
}
}
printf("%d", dp[1][1]);
return 0;
}