#include<cstdio>
#include<algorithm>
using namespace std;
#define n 8
int arr[n] = { 1, -2, 4, 1, -5, 7, -8, 3 };
int near_s[100];
void dp() {
near_s[0] = arr[0];
for (int i = 1; i < n; i++) {
near_s[i] = max(near_s[i - 1] + arr[i], arr[i]);
}
printf("dp数组:\n");
for (int i = 0; i < n; i++) {
printf("%d ", near_s[i]);
}
printf("\n");
int k = 0;
for (int i = 0; i < n; i++) {
if (k < near_s[i])
k = near_s[i];
}
printf("最大子序列和为:%d\n", k);
}
int main() {
dp();
return 0;
}
输出:
dp数组:
1 -1 4 5 0 7 -1 3
最大子序列和为:7