AcWing 898. 数字三角形
原题链接
简单
作者:
全
,
2021-02-07 20:01:36
,
所有人可见
,
阅读 249
算法1
暴力dp $O(n^logn)$
#include <iostream>
using namespace std;
const int N = 510;
int n;
int nums[N][N], dp[N][N];
int maxval ;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cin >> nums[i][j];
}
}
dp[1][1] = nums[1][1];
for (int i = 2; i <= n; i++) {
dp[i][1] = dp[i - 1][1] + nums[i][1];
}
for (int i = 2; i <= n; i++) {
dp[i][i] = dp[i - 1][i - 1] + nums[i][i];
}
for (int i = 3; i <= n; i++) {
for (int j = 2; j < i; j++) {
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - 1]) + nums[i][j];
}
}
for (int i = 1; i <= n; i++) {
if (maxval < dp[n][i])
{
maxval = dp[n][i];
}
}
cout << maxval << endl;
return 0;
}
兄弟你的log的l飞起来了