顺序表-最大段和

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n, sum, max,i, a[100001];
    scanf("%d",&n);
    sum=0;
    max = 0;
    for(i = 0; i < n; i++)
        scanf("%d",&a[i]);
    int start = 0, end = -1;
    for(i = 0; i < n; i++)
    {
        sum += a[i];
        if( sum < 0)
        {
            sum = 0;
            start = i+1;// 用start表示段的开始
        }
        if(sum > max)
        {
            max = sum;
            end = i;//段的结束
        }
        printf("sum:%d\tmax:%d\tstart:%d\tend:%d\n",sum,max,start,end);
    }
    printf("%d\n",max);
    return 0;
}