AC代码:
#include<stack>
#include<queue>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fabs(x) ((x) > 0 ? (x) : (-x))
#define eps 1e-10
using namespace std;
typedef long long ll;
int ac[101][101];
int dp[101][101];
int main() {
int t;
cin >> t;
while(t --) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cin >> ac[i][j];
}
}
for (int i = 1; i <= n; i++) {
dp[n][i] = ac[n][i];
}
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= i; j++) {
dp[i][j] = max(dp[i+1][j + 1] + ac[i][j], dp[i+1][j] + ac[i][j]);
}
}
int max_ = 0;
cout << dp[1][1] << endl;
}
}