poj 1163数塔 动态规划

#include<stdio.h>#include<stdlib.h>#include<string.h>#include<string>#include<cstring>#include<iostream>#include<algorithm>#include<math.h>using namespace std;int Arr[105][105];int main(){    int N=0,i=0,j=0;    scanf("%d",&N);    for(i=0;i<N;i++){        for(j=0;j<=i;j++){            scanf("%d",&Arr[i][j]);        }    }    for(i=N-2;i>=0;i--){        for(j=0;j<=i;j++){            Arr[i][j]+=max(Arr[i+1][j],Arr[i+1][j+1]);        }    }    printf("%d\n",Arr[0][0]); return 0;}