7-4 数塔

#include <bits/stdc++.h>

using namespace std;

int a[105][105],b[105][105];

//b[i][j] = max(b[i+1][j] , b[i+1][j+1]) + a[i][j]

int main ()

{

int n,m;

cin>>n;

while(n--){

memset(b,0,sizeof(b));

cin>>m;

for(int i = 1;i<=m;i++ )

for(int j = 1;j<=i;j++ )

cin>>a[i][j];

for(int i = m ;i>=1;i--)

for(int j = 1 ;j<=i;j++)

b[i][j] = max(b[i+1][j] , b[i+1][j+1]) + a[i][j];

cout<<b[1][1]<<endl;

}

return 0;

 }