折磨我一上午的题

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.

这题实在太烦人了，在vj上面怎么也交不上去，要么运行错误，要么超时，我前前后后交了10次左右

没有通过的代码就不在这里复制了，把正确的写一下吧(朋友的)

#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<cmath>
#define INF 0x3f3f3f3f
using namespace std;
int f[50009],ff[50009],l[50009],r[50009];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int a[50009],i,n;
        scanf("%d",&n);
        for(i=1;i<=n;i++)
            scanf("%d",&a[i]);
        memset(f,0,sizeof(f));
        memset(ff,0,sizeof(ff));
        memset(l,0,sizeof(l));
        memset(r,0,sizeof(r));
        f[1]=a[1];
        ff[n]=a[n];
        l[1]=a[1];
        r[n]=a[n];
        for(i=2;i<=n;i++)
        {
            f[i]=max(f[i-1]+a[i],a[i]);
            l[i]=max(l[i-1],f[i]);
        }
        for(i=2;i<=n;i++)
        {
            f[i]=max(f[i],f[i-1]);
        }
        int ans=-INF;
        for(i=n-1;i>=1;i--)
        {
            ff[i]=max(ff[i+1]+a[i],a[i]);
            r[i]=max(ff[i],r[i+1]);
            ans=max(ans,f[i]+ff[i+1]);
        }
        printf("%d\n",ans);
    }
}

//仅是笔记，方便以后复习