【动态规划】poj2479 Maximum sum && poj2593 Max Sequence（求两段不相交字串的最大和）

两道题都是求两段不相交的子串最大和

2479：

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

枚举两个子串的分割点i,1<=i<=n,分别求两个串的最大子串，求出的最大值即为所求。
dp[i]表示以位置i结束的子串的最大连续和时，则dp[i]=max{dp[i-1]+a[i],a[i]}

lmax[i]表示串a[1]-a[i]的最大子串和的值，则lmax[i]=max{lmax[i-1],dp[i]}

同理，

当dp[i]表示以位置i开始的子串的最大连续和时，则dp[i]=max{dp[i+1]+a[i],a[i]}

rmax[i]表示串a[i+1]-a[n]的最大子串和的值，则rmax[i]=max{rmax[i+1],dp[i]}

#include<stdio.h>
#include<algorithm>
#include<string.h>
#define N 50005
#define inf -99999999
using namespace std;
int dp[N],rmax[N],lmax[N],a[N];//dp[i]第i位时的字串最大连续和，lmax[i]表示串a[1]-a[i]的最大子串和的值，rmax[i]表示串a[i+1]-a[n]的最大子串和的值
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(dp,0,sizeof(dp));
        memset(lmax,0,sizeof(lmax));
        memset(rmax,0,sizeof(rmax));
        int n;
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
        }
        dp[0]=inf;//初始化为最小
        dp[n+1]=inf;
        lmax[0]=inf;
        rmax[n+1]=inf;
        for(int i=1; i<=n; i++)//从左往右正向找dp[i],lmax[i]
        {
            dp[i]=max(dp[i-1]+a[i],a[i]);
            lmax[i]=max(dp[i],lmax[i-1]);
        }
        for(int i=n; i>=1; i--)//从右往左正向找dp[i],rmax[i]
        {
            dp[i]=max(a[i],dp[i+1]+a[i]);
            rmax[i]=max(dp[i],rmax[i+1]);
        }
        int ans=inf;
        for(int i=1; i<=n-1; i++)//枚举分割点i
        {
            ans=max(ans,lmax[i]+rmax[i+1]);
        }
        printf("%d\n",ans);
    }
}

poj2593 Max Sequence和2479一样，
只是将数组开大，T组数据换成多组