1.5.1

/*ID:18861501LANG:C++TASK:numtri*//*------------------Header Files------------------*/#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <algorithm>#include <cstdlib>#include <ctype.h>#include <cmath>#include <stack>#include <queue>#include <map>#include <vector>#include <limits.h>using namespace std;/*------------------Definitions-------------------*/#define LL long long#define PI acos(-1.0)#define INF 0x3F3F3F3F/*---------------------Work-----------------------*/int num[1050][1050];int d[1050][1050];int N;void work(){scanf("%d",&N);for(int i=1;i<=N;i++)for(int j=1;j<=i;j++)scanf("%d",&num[i][j]);for(int j=1;j<=N;j++) d[N][j]=num[N][j];for(int i=N-1;i>=1;i--)for(int j=1;j<=i;j++)d[i][j]=num[i][j]+max(d[i+1][j],d[i+1][j+1]);printf("%d\n",d[1][1]);}/*------------------Main Function------------------*/int main(){//freopen("test.txt","r",stdin);freopen("numtri.out","w",stdout);freopen("numtri.in","r",stdin);work();return 0;}