HDOJ 2084 数塔问题

#include <iostream>
#include <fstream>
using namespace std;
int findMax(int a , int b)
{
return a >= b ?a:b;
}
int main()
{
//ifstream cin("input.txt");
int testNum,n;
int dp[101][101],a[101][101];
cin>>testNum;
while (testNum--)
{
cin>>n;
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= i ; j++)
cin>>a[i][j];
}
/*for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= i ; j++)
cout<<a[i][j]<<" ";
cout<<endl;
}*/
for (int i = 1 ; i<=n;i++)
dp
[i] = a
[i];
for(int i = n-1 ; i >= 1 ; i--)
{
for (int j = 1 ; j <= i ; j++)
{
dp[i][j] = findMax(dp[i+1][j],dp[i+1][j+1]) + a[i][j];
}
}
/*for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= i ; j++)
cout<<dp[i][j]<<" ";
cout<<endl;
}*/
cout<<dp[1][1]<<endl;
}
return 0;
}