[背包问题][第三阶段-初见dp][HDU-1003]Max Sum

Problem Description

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.

 

Sample Input

25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5

 

Sample Output

Case 1:14 1 4Case 2:7 1 6

 

import java.util.Scanner;public class Main {public static void main(String[] args) {// TODO Auto-generated method stubScanner in = new Scanner(System.in);int T = in.nextInt();int i,j,k;for(k=1;k<=T;k++){boolean tag = false;  int n = in.nextInt();int[] num = new int[n];int start=1,end=1,count=1;int sum=num[0],max=num[0];for(i=0;i<n;i++){num[i]=in.nextInt();sum+=num[i];if(num[i]>=0)tag=true;if(sum<0){sum=0;count=i+2;}if(sum>max||(max<=0&&num[i]==0)){max=sum;end=i+1;start=count;}}if(!tag){ start=1;end=1;max=num[0];for(i=1;i<n;i++)if(max<num[i]){max=num[i];start=i+1;end=i+1;}}System.out.println("Case "+k+":");System.out.println(max+" "+(start)+" "+(end));if(k!=T)System.out.println();}}}