最大子段和的求解

1.O（N^3）算法

int main(){
//    freopen("in.txt", "r", stdin);
    while(scanf("%d",&n) == 1){
        for(int i=0; i<n; i++)
            scanf("%d",&a[i]);
        int best = a[0];
        for(int i=0; i<n; i++){
            for(int j=i; j<n; j++){
                int sum = 0;
                for(int k=i; k<=j; k++)
                    sum += a[k];
                best = max(best, sum);
            }
        }
        printf("%d\n",best);
    }
    return 0;
}

2.O（N^2）

int main(){
//    freopen("in.txt", "r", stdin);
    while(scanf("%d",&n) == 1){
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        memset(sum , 0, sizeof(sum));
        int best = a[1];
        for(int i= 1; i<=n; i++) sum[i] = sum[i - 1] + a[i];
        for(int i=1; i<=n; i++){
            for(int j=i; j<=n; j++){
                best = max(best, sum[j] - sum[i-1]);
            }
        }
        printf("%d\n",best);
    }
    return 0;
}

3.O(nlog(n))（分治法）

int maxsum(int x, int y){
    if(y - x == 1)  return a[x];
    int mid = x + (y - x)/2;
    int maxs = max(maxsum(x, mid),maxsum(mid, y));
    int vv, ll, rr;
    vv= 0, ll = a[mid - 1];
    for(int i=mid-1; i>=x; i--) ll = max(ll, vv += a[i]);
    vv = 0, rr = a[mid];
    for(int i=mid; i<y; i++)    rr = max(rr, vv += a[i]);
    return max(maxs, ll+rr);
}

int main(){
//    freopen("in.txt", "r", stdin);
    while(scanf("%d",&n) == 1){
        for(int i=0; i<n; i++)
            scanf("%d",&a[i]);
        int ans = maxsum(0, n);
        cout << ans << endl;
    }
    return 0;
}