Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won t be more than 1000 people and nobody takes more than 100 seconds to cross.
Output
For each test case, print a line containing the total number of seconds required for all the N people to cross the river.
Sample Input
1
4
1 2 5 10
Sample Output
17
給定n個整數a , a , ,an 1 2 組成的序列。序列中元素i a 的符號定義為：
ï î
ï í
ì
- <
=
>
=
1 0
0 0
1 0
sgn( )
i
i
i
i
a
a
a
a
符號平衡問題要求給定序列的最長符號平衡段的長度L，即：
þ ý ü
î í ì
= + - = å
=
£ £ £
max 1| sgn( ) 0
1
j
k i
i j n k
L j i a 。
例如，當n=10，相應序列為：1，1，-1，-2，0，1，3，-1，2，-1 時，L=9。
This code sample shows how to write a simple Javadoc 1.2 Doclet. Used with Javadoc, it can generate a Unix-style inverted index for a set of Java classes, with links to real Java API documentation. Includes directions and source code.
This doclet requires JDK 1.2.1 or later, it will not work with JDK 1.1
