假设sum[i]表示以第i个数字为结尾的最大子段和,则sum[i]=max(sum[i-1]+A[i],A[i]),因为子段是连续的。。由状态转移方程可以知道,只有在sum[i-1]<0的情况下,sum[i]=A[i],否则,sum[i]=sum[i-1]+A[i],所以可以边输入边处理,一层循环搞定
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int MAXN = 50010;
ll A[MAXN];
ll sum[MAXN];
int main()
{
//freopen("in","r",stdin);
int n;
ll res;
scanf("%d",&n);
memset(sum,0,sizeof(sum));
for(int i = 1; i <= n; ++i)
scanf("%lld",&A[i]);
res = 0;
for(int i = 1; i <= n; ++i)
{
sum[i] = max(sum[i-1]+A[i],A[i]);
if(sum[i] > res)
res = sum[i];
}
printf("%lld\n",res);
return 0;
}