#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int main()
{
	int a[355][355],dp[355][355];
	int n,i,j;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		for(j=0;j<=i;j++)
		    scanf("%d",&a[i][j]);
	}
	memset(dp,0,sizeof(dp));
	for(i=n-1;i>=0;i--)
	    for(j=0;j<=i;j++)
	        dp[i][j]=max(dp[i+1][j]+a[i][j],dp[i+1][j+1]+a[i][j]);
	printf("%d\n",dp[0][0]);
}

• Re:1163&3176 (447) kigoemasuga 2017-03-07 12:11:56