解题思路
从下往上(可以减少边界分析)
从集合角度看
线性Dp
算法1
(线性Dp) $O(n^2)$
C++ 代码
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 510;
int n;
int w[N][N],h[N][N];
int main()
{
cin >> n;
for(int i = 1; i <= n; i )
for(int j = 1; j <= i; j)
cin >> w[i][j];
for(int i = 1; i <= n; i ) h[n][i] = w[n][i];
for(int i = n - 1; i; i –)
for(int j = 1; j <= i; j)
f[i][j] = max(h[i+1][j] + h[i][j], h[i+1][j+1] + h[i][j]);
cout << h[1][1] <<endl;
return 0;
}