中国大学生mooc——01-复杂度2 Maximum Subsequence Sum

01-复杂度2 Maximum Subsequence Sum （25 分）

Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } 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

• 作者: 陈越
• 单位: 浙江大学
• 时间限制: 200 ms
• 内存限制: 64 MB
• 代码长度限制: 16 KB

分析

1. 这道题实际上就是在求最大子序列的基础上，还需根据要求算出多个序列值相同时下标最小的i和j
2. 求下标i，我们需要加一个变量first_tmp来存当前的下标。
3. 需要注意的是，该题目中还包含有负数和0的情况，此时，i,j应该相等，并且都等于第一个0的位置。

import java.util.Scanner;
import java.io.*;
public class Main{
	private static Reader reader;

	public static void main(String args[]) {
		reader = new InputStreamReader(System.in);
		int n = get_int();
		int a[] = new int[n];
		for(int i = 0; i < n; i++)
		{
			a[i] = get_int();
		}
		int ans[] = sequence_get_max4(a,n);
		System.out.println(ans[0]+" " + ans[1] + " " + ans[2] );
	}
	public static int get_int()
	{
		int res = 0;
		int read,flag=1;
		try {
			while((read = reader.read()) != -1)
			{
				if(read == '-')
				{
					flag = -1;
				}
				else if(Character.isDigit(read))
				{
					res = read - '0';
					while((read = reader.read())  != -1)
					{
						if(Character.isDigit(read)) {
						res = res * 10 + (read - '0');
						}
						else
							break;
					}
					break;
				}
			}
		}catch(IOException e)
		{
			e.printStackTrace();
		}
		return flag*res;
	}

	public static int[] sequence_get_max4(int a[], int n)
	{
		int max_sum = 0,first = a[0], last = a[n-1];
		int first_tmp = 0;
		int this_sum = 0;
		int flag_zero = 0;
		for(int i = 0; i < n; i++)
		{
			if(this_sum == 0 && flag_zero == 0)/*判断序列头*/
				first_tmp = i;
			this_sum += a[i];/*向右累加*/
			if(this_sum > max_sum) {/*找到更大的累加和，更新*/
				max_sum = this_sum;
				first = a[first_tmp];
				last = a[i];
			}
			else if(this_sum < 0) {/*当前和不能使累加和增加，则丢弃*/
				this_sum = 0;
				flag_zero = 0;
			}
			else if(this_sum == 0) {
				if(max_sum == 0)/*对于负数和0的情况，获得位置*/
					first = last = a[i-flag_zero];
				flag_zero++;
					
			}
				
		}
		int ans[] = {max_sum, first,last};
		return ans;
	}
}