01-复杂度2 Maximum Subsequence Sum (25分)

最新推荐文章于 2022-03-27 18:13:52 发布

yeternity

最新推荐文章于 2022-03-27 18:13:52 发布

阅读量682

点赞数

分类专栏： PTA 基础题

本文链接：https://blog.csdn.net/yeternity/article/details/72794179

版权

PTA 同时被 2 个专栏收录

55 篇文章 7 订阅

订阅专栏

基础题

21 篇文章 2 订阅

订阅专栏

Given a sequence of integers { $N 1 $ , $N 2 $ , ..., $N K $ }. A continuous subsequence is defined to be { $N i $ , $N i + 1 $ , ..., $N j $ } where $1 \leq i \leq j \leq 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$ ( $\leq 10000$ ). The second line contains 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 and (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、在线处理的特点是新序列可能会代替旧序列，也可能不会。（新序列是指第一个元素是新的，旧序列指第一个元素还是上一次的第一个元素）

3、每次一个新序列开始时，就记下这个序列的第一个元素（它是可能的最大子列和的第一个元素）

4、每次旧序列的最大值要被一个序列代替时（最后一个元素必须更新），检查一下它是不是新序列，是的话，就把第一个元素也更新（旧序列被新序列代替）

注意点：

1、题目中有测试点是全负数的，所以要有个AllNegative的标记来分辨

2、还有个测试点是序列由0和负数组成的，MaxSum设为-1，就能把第一个0（这是个只有一个0的序列）记录下来。输出 0 0 0

#include <stdio.h>
#include <stdlib.h>
int MayBeStart = 0;	//可能的最大子列和的第一个元素
int start, end, AllNegative = 1, Update = 1;
int MaxSubsequenceSum(int a[], int N){
	int MaxSum = -1, ThisSum = 0;	//MaxSum设为-1，可以解决只有负数和零的情况
	for(int i = 0; i < N; i++){
		ThisSum += a[i];
		if ( ThisSum > MaxSum ) {
			if ( Update ) { //这是个新的序列，所以要更新第一个元素
				start = MayBeStart;
				Update = 0; //新的序列变为旧序列，旧序列不需要更新第一个元素，但是要更新最后一个
			}
			MaxSum = ThisSum;
			end = i;		//每次更换最大值时，更新子序列最后一个元素下标
			AllNegative = 0;	//表明不是全负数
		}
		else if ( ThisSum < 0 ) {
			ThisSum = 0;
			MayBeStart = i + 1;	//记录可能的第一个元素下标
			Update = 1;	//新的序列又开始了
		}
	}
	return MaxSum;
}
int main(){
	int N, a[10005], sum;
	scanf("%d", &N);
	for(int i = 0; i < N; i++)
		scanf("%d", &a[i]);
	sum = MaxSubsequenceSum(a, N);
	if ( !AllNegative ) { //如果不是全负数
		printf("%d %d %d", sum, a[start], a[end]);
		//printf("%d %d %d", MaxSubsequenceSum(a, N), a[start], a[end]);	//函数不会改变start和end的值  为什么？？？
		//printf("%d %d", start, end); //这里的start和end改变了，说明上一步三个输出是同时进行的（可能）
	}
	else
		printf("0 %d %d", a[0], a[N - 1]);
	system("pause");
	return 0;
}