1.5.1 Number Triangles

/*ID: zhangzz4PROG: numtriLANG: C++*/#include<stdio.h>const int N=1001;int f[N][N];int max(int a,int b){return a>b?a:b;}int main(){ freopen("numtri.in","r",stdin); freopen("numtri.out","w",stdout); int n; scanf("%d",&n); for(int i=1;i<=n;i++) for(int j=1;j<=i;j++) scanf("%d",&f[i][j]); for(int i=2;i<=n;i++) for(int j=1;j<=i;j++) f[i][j]+=max(f[i-1][j],f[i-1][j-1]); int sum=0; for(int i=1;i<=n;i++) sum=max(sum,f[n][i]); printf("%d/n",sum);}