题目如下:
思路
问题要求最大的路径和。采用动态规划,注意路线中包含负数。
代码如下:
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[505][505], dum[505][505];
cin >> n;
memset(dum, 0, sizeof dum);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cin >> a[i][j];
dum[i][j] = a[i][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
if (dum[i - 1][j] != 0 && dum[i - 1][j - 1] != 0 )
dum[i][j] += max(dum[i - 1][j], dum[i - 1][j - 1]);
if (dum[i - 1][j] != 0 && dum[i - 1][j - 1] == 0 )
dum[i][j] += dum[i - 1][j];
if (dum[i - 1][j] == 0 && dum[i - 1][j - 1] != 0 )
dum[i][j] += dum[i - 1][j - 1];
}
}
sort(dum[n] + 1, dum[n] + n + 1);
cout << dum[n][n];
return 0;
}