POJ 3176

//11148335	c00h00g	3176	Accepted	1364K	79MS	G++	675B	2012-12-30 13:21:47
//水体，练手，数塔问题 
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;

int mat[355][355];
int dp[355][355];
int N;

int main(){
    scanf("%d",&N);
    for(int i=1;i<=N;i++){
        for(int j=1;j<=i;j++){
            scanf("%d",&mat[i][j]);
            dp[i][j]=mat[i][j];
        }
    }
    for(int i=2;i<=N;i++){
        for(int j=1;j<=i;j++){
            dp[i][j]=dp[i-1][j]+dp[i][j];
            if(j-1>0)
                dp[i][j]=max(dp[i][j],mat[i][j]+dp[i-1][j-1]);
        }
    }
    int res=-1;
    for(int i=1;i<=N;i++){
        if(dp[N][i]>res)
            res=dp[N][i];
    }
    printf("%d\n",res);
    return 0;    
}