HDU 2084 数塔 DP

参考：https://blog.csdn.net/theonegis/article/details/45801201

https://blog.csdn.net/murmured/article/details/17484239

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N=150;
int dp[N][N];
int main()
{
    int t;
    while (cin>>t)
    {
        while (t--)//注意题目的输入顺序！
        {
            int n;
            cin>>n;
            for (int i=0;i<n;i++)
            {
                for (int j=0;j<=i;j++)
                {
                    cin>>dp[i][j];
                }
            }
            for (int i=n-2;i>=0;i--)
            {
                for (int j=0;j<=i;j++)
                {
                    dp[i][j]=dp[i][j]+max(dp[i+1][j],dp[i+1][j+1]);
                }
            }
            cout<<dp[0][0]<<endl;
        }
    }

    return 0;
}