1 #include <stdio.h> 2 #include <iostream> 3 #include <algorithm> 4 #include <math.h> 5 #include <string.h> 6 #include <vector> 7 #include <queue> 8 using namespace std; 9 10 int f[110][110];11 int main(){12     int n;13     while(scanf("%d",&n)!=EOF){14         memset(f,0,sizeof(f));15         for(int i=1;i<=n;i++)16             for(int j=1;j<=i;j++){17                 scanf("%d",&f[i][j]);18             }19         for(int i=2;i<=n;i++){20             for(int j=1;j<=n;j++)21                 if(j==1) f[i][j] += f[i-1][j];22                 else if(j==i) f[i][j] += f[i-1][j-1];23                 else{24                     f[i][j] += max(f[i-1][j-1],f[i-1][j]);25                 }26         }27         int Max = f[n][1];28         for(int i=2;i<=n;i++) Max = max(Max,f[n][i]);29         printf("%d\n",Max);30     }31     32     33     return 0;34 }