Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output two lines. The first line 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.
code
import java.math.BigInteger;import java.util.Scanner;publicclassMain{publicstaticvoidmain(String[] args){
Scanner in =newScanner(System.in);int T = in.nextInt();for(int i1 =0; i1 < T; i1++){int N = in.nextInt();int a[]=newint[N];int sum =0;int max =-1001;int start =0;int end =0;int temp =0;for(int i2 =0; i2 < N; i2++){
a[i2]= in.nextInt();
sum += a[i2];if(sum > max){
max = sum;
start = temp;
end = i2;}if(sum <0){
sum =0;
temp = i2 +1;}}
System.out.println("Case "+(i1+1)+":");
System.out.println(max+" "+(start+1)+" "+(end+1));if(i1 != T-1){
System.out.println();}}}}
HDOJ 1003Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (...