题目来源：
Given a sequence of K integers { N1, N2, …, NK}. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj} where 1 <= i <= j <= K. TheMaximum Subsequenceis the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.
Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.
Input Specification:
Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.
Output Specification:
For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.
Sample Input:10-10 1 2 3 4 -5 -23 3 7 -21Sample Output:10 1 4
解：import java.util.Scanner;public class Main{/***（方法说明）*@param 无*@return 无*@throws 无*/public static void main(String[] args){Scanner scanner = new Scanner(System.in);//正整数 k int k = scanner.nextInt();//最大子列和int max=scanner.nextInt();//最大子列和的开始下标 ,到当前下标i的和int sum=max;//开始的数字int start = max;int prestart =max;boolean pre = false;//结束的数字int end =max;int n=0;for(int i=1;i<k;i++){n=scanner.nextInt();sum = sum+n;if(n>sum){sum=n;prestart =n;pre=true;if(n>max) {max=n;if(pre)start = prestart;end = n;}}else if(sum>max){max = sum;if(pre)start = prestart;end = n;}}//记录最大子列和if(max>=0)System.out.println(max+" "+start+" "+end);else System.out.println(0+" "+start+" "+n);}}
，青春一经典当即永不再赎
