Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 228524 Accepted Submission(s): 53767
Given a sequence a,a,a......a[n], your job is to calculate themaxsumofa sub-sequence. For example, given (6,-1,5,4,-7), themaxsumin this sequence is 6 + (-1) + 5 + 4 = 14.
The firstlineofthe input containsaninteger T(1<=T<=20) which means thenumberof test cases. Then T lines follow, eachline starts withanumber N(1<=N<=100000), then N integers followed(all the integers are between -1000and1000).
For each test case, you should output twolines. The firstline is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
256 -154 -7706 -11 -67 -5