The Triangle
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
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<cstdio>
#include<cstring>
#include<algorithm>
#define maxn 105
using namespace std;
int f[maxn][maxn];
int a[maxn][maxn];
int main()
{
int n,i,j;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;i++)
for(j=1;i<=i;j++)
scanf("%d",&a[i][j]);
memset(f,0,sizeof(f));
for(j=1;j<=i;j++)
{
if(i==1)f[i][j]=a[i][j];
else if (j==1)f[i][j]=f[i-1][j]+a[i][j];
else if (j==i)f[i][j]=f[i-1][j-1]+a[i][j];
else f[i][j]=max(f[i-1,[j],f[i-1][j-1]])+a[i][j];
}
int ans=0;
for(i=1;i<n;i++)
ams=max(anx,f[n][i]);
printf("%d\n",ans);
}
return 0;
}