Preparing NOJ

Maximum sum

1000ms 65536K

Description:

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

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

Note:

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

Huge input,scanf is recommended.

Info

Provider POJ

Origin POJ Contest

Code POJ2479

Tags

Submitted 19

Passed 5

AC Rate 26.32%

Date 03/06/2019 15:42:49

Related

Nothing Yet