triangulo.cpp

#include <bits/stdc++.h>

using namespace std;

const int maxn = 110;

int v[maxn][maxn];
int dp[maxn][maxn];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n;
	cin >> n;

	for (int i = 1; i <= n; i++) {

		for (int j = 1; j <= i; j++) cin >> v[i][j];
	}
		
	for (int i = 1; i <= n; i++) dp[n][i] = v[n][i];

	for (int i = n-1; i >= 1; i--) {

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

			dp[i][j] = v[i][j] + max(dp[i+1][j], dp[i+1][j+1]);
		}
	}

	cout << dp[1][1] << "\n";

	return 0;
}