max sum 1003 java_HDOJ Max Sum JAVA 1003

简单DP

最大字符串问题

从后往前，按DP思想，一个一个看。SUM<0就不要再继续加了

看代码：(PE，输出格式找不到错在哪里，怎么输出都PE)

/**

*

*/

/**

* @author Enron

*

*/

package _1003;

import java.util.Scanner;

public class Main{

public static void main(String[] args){

Scanner sc = new Scanner(System.in);

int T = sc.nextInt();

int t = 0;

while(++t<=T){

int n = sc.nextInt();

int ns [] = new int[n];

for (int i = 0; i < ns.length; i++) {

ns[i] = sc.nextInt();

}

int s=-1,e=-1;

int ms=-1,me=-1;

int max=-9999,sum=0;

for (int i = ns.length-1; i >= 0; i--) {

if(sum==0)e =i+1;

sum += ns[i];

s = i+1;

//System.out.println(sum+" "+i);

if(sum>=max){

max = sum;

ms = s;

me = e;

}

if(sum<0){

sum = 0;

}

}

System.out.printf("Case %d:\n%d %d %d\n",t,max,ms,me);

if(t!=T){

System.out.printf("\n");

}

//if(t==T){

//System.out.print(max+" "+ms+" "+me);

//}

//else{

//System.out.println(max+" "+ms+" "+me);

//System.out.println();

//}

}

}

}

Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 262402    Accepted Submission(s): 62374

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

2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5

Sample Output

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

Author

Ignatius.L