1007. Maximum Subsequence Sum (25)
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 -21Sample Output:
10 1 4
还是应该从特征入手。从初始点开始累加,当子序列和小于零时直接舍弃计算后续。
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
ArrayList<Integer> aNum = new ArrayList<Integer>();
boolean bNegativeFlag = true;
int iMaxSum = -1;
int iStart = Integer.MAX_VALUE;
int iEnd = 1;
aNum.add(-1);//方便从1开始计数
Scanner s = new Scanner(System.in);
int n = s.nextInt();
for(int i=0; i<n; i++){
int j = s.nextInt();
if(j>=0) bNegativeFlag = false;
aNum.add(j);
}
for(int i=1; i<=n; i++){//起点变化
int iSum =0, j;
for(j=i; j<=n; j++){//范围变化
iSum += aNum.get(j);
if(iSum < 0){
break;
}
if(iSum > iMaxSum){
iMaxSum = iSum;
iStart = i;
iEnd = j;
}
}
i = j;
}
if(bNegativeFlag){
System.out.printf("%d %d %d", 0, aNum.get(1), aNum.get(n));
}else{
System.out.printf("%d %d %d", iMaxSum, aNum.get(iStart), aNum.get(iEnd));
}
}
}