View Code of Problem 65

#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;

int main()
{
	int i, j, k, flag;
	int n, m, t;
	string str, s;
	cin >> t;
	while (t--)
	{
		int a[1000][1000] = { 0 };
		int f[1000][1000] = { 0 };
		cin >> n;
		for (i = 0; i < n; ++i)
		{
			for (j = 0; j < i + 1; ++j)
				cin >> a[i][j];
		}
		/*i = n - 1;
		for (j = 0; j < n; ++j)
			f[i][j] = a[i][j];*/
		for (i = n - 1; i >= 0; --i)
			for (j = 0; j < i + 1; j++)
				f[i][j] = a[i][j] + max(f[i + 1][j], f[i + 1][j + 1]);
		cout << f[0][0] << endl;
	}
	return 0;
}