POJ_1163_The Triangle

///简单DP
#include<stdio.h>
#include<string.h>
int n;
int triangle[105][105];
int sum[105][105];
int main()
{
while(scanf("%d",&n)==1)
{
int i,j;
memset(triangle,0,sizeof(triangle));
for(i=1;i<=n;i++)
{
for(j=1;j<=i;j++)
scanf("%d",&triangle[i][j]);
}
sum[1][1]=triangle[1][1];
for(i=2;i<=n;i++)
{
for(j=1;j<=i;j++)
{
if(j==1)
sum[i][j]=triangle[i][j]+sum[i-1][j];
else
{
if(sum[i-1][j-1]>sum[i-1][j])
sum[i][j]=sum[i-1][j-1]+triangle[i][j];
else
sum[i][j]=sum[i-1][j]+triangle[i][j];
}
}
}
int max=0;
for(i=1;i<=n;i++)
if(max<sum
[i])
max=sum
[i];
printf("%d/n",max);
}
return 0;
}