http://hihocoder.com/problemset/problem/1037
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#define inf 0x3f3f3f3f
#define mem(a,x) memset(a,x,sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline int in()
{
int res=0;char c;
while((c=getchar())<'0' || c>'9');
while(c>='0' && c<='9')res=res*10+c-'0',c=getchar();
return res;
}
int maze[111][111];
int main()
{
int n=in();
for(int i=0;i<n;i++)
{
for(int j=0;j<=i;j++)
{
scanf("%d",&maze[i][j]);
}
}
for(int i=n-1;i>=0;i--)
{
for(int j=0;j<=i;j++)
{
maze[i][j] += max(maze[i+1][j],maze[i+1][j+1]);
}
}
printf("%d\n",maze[0][0]);
return 0;
}