SP237 SUMITR - Sums in a Triangle

动态规划，与这题基本相同，只不过有多组测试。压行即可：

#include<bits/stdc++.h>
using namespace std;
#define R(a,b) for(a=1;a<=b;a++)
const int N=1e3+5;int a[N][N],i,j,n,T,g;main(){cin>>T;R(g,T){int l=0;cin>>n;R(i,n)R(j,i){cin>>a[i][j];a[i][j]+=max(a[i-1][j],a[i-1][j-1]);l=max(l,a[i][j]);}cout<<l<<endl;}}