算法竞赛入门经典 例题8-1

/*
最大连续和 n^3,nlgn,n
*/
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cmath>
#include <set>
using namespace std;
const int MAX = 50;
int A[MAX];
int n;

// n^3
int solve_n3(){
    int max_val = 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];
            }
            if(sum > max_val) max_val = sum;
        }
    }
    return max_val;
}

int solve_n() {
    int s_min = 0;
    int s = 0;
    int best = -1000000;
    for(int i=0; i<n; i++) {
        s += A[i];
        if(best < s-s_min) {
            best = s - s_min;
        }
        if(s < s_min) s_min = s;
    }
    return best;
}

//nlgn
int solve_nlgn(int p, int q)
{
    if(q-p == 1) return A[p];
    else {
        int m = p + (q-p)/2;
        int l = solve_nlgn(p, m);
        int r = solve_nlgn(m, q);
        int left_most = A[m-1];
        int sum = 0;
        for(int i=m-1; i>=p; i--) {
            sum += A[i];
            if(sum > left_most) left_most = sum;
        }
        int right_most =  A[m];
        sum = 0;
        for(int i=m; i<q; i++) {
            sum += A[i];
            if(sum > right_most) right_most = sum;
        }
        int most =  l > r ? l : r;
        most = most > right_most+left_most ? most : left_most + right_most;
        return most;
    }
}

int main(){
    #ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    #endif
    while(scanf("%d", &n) == 1) {
        for(int i=0; i<n; i++) {
            scanf("%d", &A[i]);
        }
        printf("n3: %d\n", solve_n3());
        printf("n: %d\n", solve_n());
        printf("nlgn: %d\n", solve_nlgn(0, n));
    }
    return 0;
}