问题描述:
题解:
#include <iostream>
using namespace std;
using ll = long long;
const int N = 105;
ll a[N][N], dp[N][N];
int main()
{
int n;cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= i; j++)cin >> a[i][j];
for(int i = n; i >= 1; i--)
for(int j = 1; j <= i; j++)
dp[i][j] = a[i][j] + max(dp[i + 1][j], dp[i + 1][j+1]);
cout << dp[1][1] << '\n';
return 0;
}
知识点:动态规划