翻译题12动态规划

1481:Maximum sum

​​​​​​​【最大的和】

总时间限制: 

1000ms

内存限制: 

65536kB

描述

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

【给出n个数：A={a1，....an}，我们定义一个函数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).

【你的任务是计算函数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.

【输入包含T组测试样例。数字T在输入的第一行】
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.

【每组测试样例包含2行，第一行是数字n(2<=n<=50000)。第二行则包含n个数据：a1,a2...an. (|ai| <= 10000).每组样例后有一行空格。】

输出

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

【对于每组输入测试数据，输出函数值d（A）】

样例输入

1

10
1 -1 2 2 3 -3 4 -4 5 -5

样例输出

13

提示

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

Huge input,scanf is recommended.

来源

POJ Contest,Author:Mathematica@ZSU