扩展题
AcWing 1015. 摘花生
AcWing 1027. 方格取数
AcWing 382. K取方格数
C++ 代码
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 510;
int n;
int f[N][N];
int main()
{
cin >> n;
for (int i = 1; i<= n; i++)
for (int j = 1; j <= i; j++ )
cin >> f[i][j];
for (int i = n - 1; i; i -- )
for (int j = 1; j <= i; j++ )
f[i][j] += max( f[i + 1][j], f[i + 1][j + 1]);
cout << f[1][1] << endl;
return 0;
}