View Code of Problem 65

#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<stack>
#include<map>
#include<vector>
#include<cstdbool>
using namespace std;
int p[1001][1001];
int main()
{
	int y, c;
	cin >> y;
	while (y--) {
		cin >> c;
		for (int i = 0; i < c; i++) {
			for (int y = c - i - 1; y < c; y++) {
				cin >> p[i][y];
			}
		}
		for (int i = c - 2; i >= 0; i--) {
			for (int y = c - i-1; y < c; y++) {
				p[i][y] = p[i][y] + max(p[i + 1][y], p[i + 1][y - 1]);
			}
		}
		cout << p[0][c - 1] << endl;

	}
	return 0;
}