HDU-1176 数字三角形(动态规划 记忆化搜索)
7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1)
Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
Output
Your program is to write to standard output. The highest sum is written as an integer.
Sample Input
5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5Sample Output
30
#include<cstdio>
#include<algorithm>
using namespace std;
int dp[120][120],a[120][120],n;
int solve(int i,int j)
{
if(dp[i][j]>=0)
return dp[i][j]; //记忆化搜索的处理
return dp[i][j]=a[i][j]+(i==n?0:max(solve(i+1,j),solve(i+1,j+1)));
}
int main()
{
int i,j,m;
scanf("%d",&n);
for(i=0;i<n;i++)
for(j=0;j<=i;j++)
{
scanf("%d",&a[i][j]);
dp[i][j]=-1;
}
m=solve(0,0);
printf("%d\n",m);
return 0;
}