动态规划-三角形

#include <iostream>
#include<string>
#include<string.h>
using namespace std;

int main()
{
    int n,i,j,a[100][100],T=0,f[100][100];
    cin>>T;
    while(T--)
    {
        memset(a,0,sizeof(a));
        memset(f,0,sizeof(f));
        n=0;

        cin>>n;
        for(i=1;i<=n;i++)
            for(j=1;j<=i;j++)
                cin>>a[i][j];

        for(i=n;i>=1;i--)
            for(j=1;j<=i;j++)
                f[i][j]=max(f[i+1][j],f[i+1][j+1])+a[i][j];

        cout<<f[1][1]<<endl;
    }

    return 0;
}