#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int main(){
int t,n;
int a[110][110],dp[110][110];
cin>>t;
while(t--){
memset(dp,0,sizeof(dp));
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<=i;j++)
cin>>a[i][j];
for(int i=n-1;i>=0;i--)
for(int j=0;j<i+1;j++){
dp[i][j]=a[i][j]+max(dp[i+1][j],dp[i+1][j+1]);
}
cout<<dp[0][0]<<endl;
}
}
/*Sample Input
1
5
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Sample Output
30
*/
08-13
276
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)