原题链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1050
思路:这里有两种情况,一种是数组最大字段和是循环的,一种是不循环的,不循环的可以直接dp求解,可循环的数组最大字段和不好找,但是最小字段和好找,dp出最小字段和,然后用总和减去就是所求值
AC代码:
#include<bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
int a;
int main() {
int n;
scanf("%d", &n);
long long pre = 0;
long long MAX = 0, MIN = 0, sum1 = 0, sum2 = 0, sum3 = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a);
sum1 += a;
if (sum2 >= 0)sum2 += a;
else sum2 = a;
if (sum3 <= 0)sum3 += a;
else sum3 = a;
MAX = max(sum2, MAX);
MIN = min(sum3, MIN);
}
printf("%lld\n", max(MAX, sum1 - MIN));
return 0;
}