The Triangle
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 42757 | Accepted: 25834 |
Description
7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1)
Input
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 5
Sample Output
30大致题意:比较简单==不说了
动态规划,记忆化搜索,当前状态是本层,前一个状态是上一层,具体直接见代码
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
int a[105][105],maxn=-1,f[105][105];
int solve(int i,int j)
{
if(f[i][j]!=0)return f[i][j];//记忆化搜索
else
{
if(i==0)return f[i][j]=a[0][0];
else
{
if(j>0)return f[i][j]=max(solve(i-1,j-1),solve(i-1,j))+a[i][j];
else if(j==i)return f[i][j]=solve(i-1,j-1)+a[i][j];
else return f[i][j]=solve(i-1,j)+a[i][j];
}
}
}
int main()
{
int n,i,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
for(j=0;j<=i;j++)
{
scanf("%d",&a[i][j]);
}
}
for(j=0;j<n;j++)
if(solve(n-1,j)>maxn)maxn=solve(n-1,j);
printf("%d\n",maxn);
return 0;
}