數塔問題

#include <bits/stdc++.h>

using namespace std;

static int dp[10][10];

int main(void)
{
	int n;
	cin >> n;
	for (int i = 1;i <= n;i++)for (int j = 1;j <= i;j++)cin >> dp[i][j];
	for (int i = n - 1;i >= 1;i--)for (int j = 1;j <= i;j++)dp[i][j] += max(dp[i + 1][j + 1], dp[i + 1][j]);
	cout << dp[1][1];
}