993 Maximum sum
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).
t1 t2
d(A) = max{ ∑ai + ∑aj | 1 <= s1 <= t1 < s2 <= t2 <= n }
i=s1 j=s2
Your task is to calculate d(A).
输入格式
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.
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.
输出格式
Print exactly one line for each test case. The line should contain the integer d(A).
示例 1
输入
1 10 1 -1 2 2 3 -3 4 -4 5 -5
输出
13
示例 2
输入
3 10 1 -1 2 2 3 -3 4 -4 5 -5 6 1 1 1 1 1 1 6 1 -1 1 -1 1 -1
输出
13 6 2
示例 3
输入
1 2 1 -1
输出
0
提示
In the sample, we choose {2,2,3,-3,4} and {5}, then we can get the answer.
Huge input,scanf is recommended.
Huge input,scanf is recommended.
输入样例
输出结果