思路:DP水题
#include<iostream>
#include<cstdio>
#include<cstring>
#define MAX 105
using namespace std;
int dp[MAX][MAX], a[MAX][MAX];
int main(){
int c, n, maxn;
/* freopen("in.c", "r", stdin); */
scanf("%d", &c);
while(c--){
memset(dp, 0, sizeof(dp));
maxn = 0;
scanf("%d", &n);
for(int i = 1; i <= n;i ++){
for(int j = 1;j <= i;j ++){
scanf("%d", &a[i][j]);
dp[i][j] = max(dp[i-1][j] + a[i][j], dp[i-1][j-1] + a[i][j]);
maxn = max(maxn, dp[i][j]);
}
}
printf("%d\n", maxn);
}
}