DP

HDU 2084 数塔

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int d[1001][1001],a[1001][1001];
int n;
int solve(int i,int j)
{
    if(d[i][j]>=0) return d[i][j];
    return d[i][j]=a[i][j]+(i==n?0:max(solve(i+1,j),solve(i+1,j+1)));
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        memset(d,-1,sizeof(d));
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=i;j++)
                cin>>a[i][j];
        }
        cout<<solve(1,1)<<endl;
    }
    return 0;
}