poj2479——Maximum sum（dp）

Description

Given a set of n integers: A={a1, a2,…, an}, we define a function d(A) as below:

Your task is to calculate d(A).
Input

The input consists of T(<=30) test cases. The number of test cases (T) is given in the first line of the input.
Each test case contains two lines. The first line is an integer n(2<=n<=50000). The second line contains n integers: a1, a2, …, an. (|ai| <= 10000).There is an empty line after each case.
Output

Print exactly one line for each test case. The line should contain the integer d(A).
Sample Input

1

10
1 -1 2 2 3 -3 4 -4 5 -5
Sample Output

13

正向求一遍最大子序列和，用dp1[i]表示从1到i的最大子序列和
反向求一遍dp2，道理如上
接下来只要一次遍历序列找最大值就过了

#include<iostream>
#include <cstdio>
#include <algorithm>
#include<cmath>
#include <cstring>
#define MAXN 50010
#define inf 0x3f3f3f3f
using namespace std;
long long dp1[MAXN],a[MAXN],dp2[MAXN],maxsum;
int main()
{
    int t,n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=1; i<=n; ++i)
            scanf("%I64d",&a[i]);
        int tmp=a[1];
        if(tmp<0)
        {
            tmp=0;
        }
        maxsum=a[1];
        dp1[1]=a[1];
        for(int i=2; i<=n; ++i)
        {
            tmp+=a[i];
            if(maxsum<tmp)
                maxsum=tmp;
            if(tmp<0)
                tmp=0;
            dp1[i]=maxsum;
        }
        tmp=a[n];
        if(tmp<0)
            tmp=0;
        maxsum=a[n];
        dp2[n]=a[n];
        for(int i=n-1; i>=1; --i)
        {
            tmp+=a[i];
            if(maxsum<tmp)
                maxsum=tmp;
            if(tmp<0)
                tmp=0;
            dp2[i]=maxsum;
        }
        maxsum=-999999999;
        for(int i=1; i<n; ++i)
        {
            int j=i+1;

            tmp=dp1[i]+dp2[j];
            if(tmp>maxsum)
                maxsum=tmp;
        }

        printf("%I64d\n",maxsum);
    }
    return 0;
}