poj 2479

和poj 2593解法相同

#include <cstdio>
#include<iostream>
using namespace std;
const int Max = 100005;
const int inf = 9999;
 
int num[Max], dp[Max], le[Max], ri[Max];
 
int max(int a, int b){
    return a > b ? a : b;
}
 
int main(){
    int n,t, i;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(i = 1; i <= n; i ++)
            scanf("%d", &num[i]);
        dp[0] = dp[n+1] = -inf;
        le[0] = ri[n+1] = -inf;
        for(i = 1; i <= n; i ++)
            dp[i] = max(dp[i-1] + num[i], num[i]);
        for(i = 1; i <= n; i ++)
            le[i] = max(dp[i], le[i-1]);
        for(i = n; i >= 1; i --)
            dp[i] = max(dp[i+1] + num[i], num[i]);
        for(i = n; i >= 1; i --)
            ri[i] = max(dp[i], ri[i+1]);
        int ans = -inf;
        for(i = 1; i < n; i ++)
            ans = max(ans, le[i] + ri[i+1]);
        printf("%d\n", ans);
    }
    return 0;
}