POJ 1163 The Triangle

#include<iostream>#include<algorithm>using namespace std;int main(){const int size=101;int triangle[size][size];int* maxSum;int n;//行数int i,j;cin>>n;for(i=1;i<=n;i++)for(j=1;j<=i;j++)cin>>triangle[i][j];maxSum=triangle[n];for(i=n-1;i>=1;i--)for(j=1;j<=i;j++)maxSum[j] = max( maxSum[j] , maxSum[j+1] ) + triangle[i][j];cout<<maxSum[1]<<endl;    return 0;}