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. The Maximum Subsequence is 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 -21
Sample Output:
10 1 4
代码如下:
import java.util.Scanner;
public class Main {
public static void main(String[] args){
//处理输入
Scanner input = new Scanner(System.in);
String lenStr = input.nextLine();
String arrStr = input.nextLine();
int len = Integer.parseInt(lenStr.trim());
int[] arr = new int[len];
String[] strings = arrStr.split(" ");
for (int i = 0; i <len ; i++) {
arr[i] = Integer.parseInt(strings[i].trim());
}
//求最大子列和,及首尾数字
printArr(getMaxSubSeqSum(arr));
}
//求最大子列和,及首尾数字
public static int[] getMaxSubSeqSum(int[] arr){
int thisSum = 0;
//使maxSum的初始值为-1(处理数组中全是负数和0的情况)
int maxSum = -1;
int firstNum = arr[0];
//使lastNum的初始值为数组最末尾数(处理数组中全是负数的情况)
int lastNum = arr[arr.length-1];
int tempFirst = arr[0];
for (int i = 0; i <arr.length ; i++) {
thisSum += arr[i];
int tempLast = arr[i];
if(thisSum > maxSum){
maxSum = thisSum;
lastNum = tempLast;
firstNum = tempFirst;
}else if (thisSum < 0){
thisSum = 0;
if(i!=arr.length-1){
tempFirst = arr[i+1];
}else{
tempFirst = arr[i];
}
}
}
//处理数组中全是负数和0的情况
if(maxSum == -1){
maxSum = 0;
}
int[] result = {maxSum,firstNum,lastNum};
return result;
}
//打印数组
public static void printArr(int[] arr){
String str = "";
for (int i = 0; i < arr.length ; i++) {
str += arr[i] + " ";
}
System.out.println(str.trim());
}
}