数塔取数问题
// 核心 dp[i][j] = max(dp[i + 1][j], dp[i + 1][j + 1]) + dp[i][j];
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[505][505];
int main()
{
int n;
while (cin >> n) {
for (int i = 0; i < n; i ++)
for (int j = 0; j < i + 1; j ++)
cin >> dp[i][j];
for (int i = n - 2; i >= 0; i --)
for (int j = 0; j < i + 1; j ++)
dp[i][j] = max(dp[i + 1][j], dp[i + 1][j + 1]) + dp[i][j];
cout << dp[0][0] << endl;
}
}
// 核心 dp[i][j] = max(dp[i + 1][j], dp[i + 1][j + 1]) + dp[i][j];
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[505][505];
int main()
{
int n;
while (cin >> n) {
for (int i = 0; i < n; i ++)
for (int j = 0; j < i + 1; j ++)
cin >> dp[i][j];
for (int i = n - 2; i >= 0; i --)
for (int j = 0; j < i + 1; j ++)
dp[i][j] = max(dp[i + 1][j], dp[i + 1][j + 1]) + dp[i][j];
cout << dp[0][0] << endl;
}
}