【poj 2479】Maximum sum DP

Language:
Maximum sum
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 37722 Accepted: 11788

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

Hint
In the sample, we choose {2,2,3,-3,4} and {5}, then we can get the answer.

Huge input,scanf is recommended.

Source
POJ Contest,Author:Mathematica@ZSU

题目链接：http://poj.org/problem?id=2479
题意：给定n个数，求两段连续不重叠子段的最大和。比如1 -1 2 2 3 -3 4 -4 5 -5结果就是 {2,2,3,-3,4} 和 {5}，也就是两者的和13。
思路：dp求求最大字段和的状态转移方程：b[j] = max {b[j-1] + a[j], a[j]}, 1 <= j <= n。

代码：

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int a[50005],b[50005];
int aa[50005];
int dp1[50005],dp2[50005];
int T;
int n;
int ans=0;
int DP()
{

    for(int i=0;i<=n+1;i++) dp1[i]=dp2[i]=-99999999;
    ans=-99999999;
    for(int i=1;i<=n;i++)
    {
        a[i]=max(a[i-1]+aa[i],aa[i]);
    }
    for(int i=n;i>=1;i--)
    {
        b[i]=max(b[i+1]+aa[i],aa[i]);
    }
    for(int i=1;i<=n;i++)
    dp1[i]=max(dp1[i-1],a[i]);
    for(int i=n;i>=1;i--)
    dp2[i]=max(dp2[i+1],b[i]);
    for(int i=1;i<=n;i++)
    ans=max(dp1[i]+dp2[i+1],ans);
    return ans;


}
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++) scanf("%d",&aa[i]);
        printf("%d\n",DP());    
    }


}