1003 .
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.
我的思路是用max来保存当前最大的和值,sum一直累加,一旦sum<0了,则清空sum(sum=0),记录下此时的位置,从当前位置继续累加,最后得到的max就是最大值,位置可以用变量也一起记录下来。
import java.util.Scanner;
public class Main {
public static void main(String args[]){
Scanner s=new Scanner(System.in);
int T=s.nextInt();
for(int i=0;i<T;i++){
int n=s.nextInt();
int sum=0,max=-1001;
int start=0,end=0,z=0;
for(int j=0;j<n;j++){
int a=s.nextInt();
sum=sum+a;
if(max<sum){
max=sum;
end=j;
start