在线算法求解 最大连续子段和
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int a[n];
for(int i = 0; i < n; ++i)
scanf("%d",&a[i]);
int maxsum = 0;
int nowsum = 0;
for(int i = 0; i < n; ++i)
{
nowsum += a[i];
if(nowsum > maxsum)
maxsum = nowsum;
if(nowsum < 0)
nowsum = 0;
}
printf("%d\n",maxsum);
return 0;
}