数字三角形

//计蒜客捡水果#include<iostream>#include<cstring>#include<algorithm>using namespace std;int n;int a[1001][1001];void down(int n){    for(int i=n-1;i>=1;i--)    {    for(int j=1;j<=i;j++){    a[i][j]=max(a[i+1][j],a[i+1][j+1])+a[i][j];}}}int main(){cin>>n;for(int i=1;i<=n;i++){for(int j=1;j<=i;j++){cin>>a[i][j];}}down(n);cout<<a[1][1]<<endl;return 0;}