Maximum Subsequence Sum（java）

最新推荐文章于 2022-07-15 14:20:26 发布

weixin_38902950

最新推荐文章于 2022-07-15 14:20:26 发布

阅读量290

点赞数 1

分类专栏：数据结构

本文链接：https://blog.csdn.net/weixin_38902950/article/details/80648257

版权

数据结构专栏收录该内容

35 篇文章 1 订阅

订阅专栏

7-1 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 -21

Sample Output:

10 1 4

思路：

1、在线处理，就是每输入一个数据就进行即时处理，实时获得当前最优解。

2、题目是输出最大子序列的第一个数字和最后一个数字，不是下标，注意审题。

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;

public class Main {
	static int n;

	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		StreamTokenizer in = new StreamTokenizer(new BufferedReader(
				new InputStreamReader(System.in)));

		in.nextToken();
		int n = (int) in.nval;
		int[] num = new int[n];
		for (int i = 0; i < n; i++) {
			in.nextToken();
			num[i] = (int) in.nval;
		}

		int start = -1, end = 0, sum = -1;
		int s = -1, e = 0, temp = 0;
		int index = 0;
		while (index < n) {
			if (num[index] >= 0) {
				temp = temp + num[index];
				e = index;
				if (s == -1)
					s = index;
				if (temp > sum) {
					sum = temp;
					start = s;
					end = e;
				}
			} else {
				temp = temp + num[index];
				if (temp < 0) {
					temp = 0;
					s = -1;
				} else {
					e = index;
				}
			}
			index++;

		}
		if (sum < 0 && n > 0) {
			System.out.print("0" + " " + num[0] + " " + num[n - 1]);
		} else if (sum >= 0)
			System.out.print(sum + " " + num[start] + " " + num[end]);
		else
			System.out.print(0);
	}

}