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

最新推荐文章于 2020-07-24 14:00:04 发布

原创最新推荐文章于 2020-07-24 14:00:04 发布 · 638 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

PAT

本文探讨了最大子序列和问题的求解方法，通过一个具体示例详细介绍了如何找到连续子序列中元素和最大的部分，并给出了实现这一功能的C++代码。特别注意了边界条件的处理。

Given a sequence of K integers { N₁, N₂, ..., 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

对于这个题目，我只能说自己的没有看题么。

人家让输出的是，输出的最大子列和的子列的index处的数值，我竟然输出的是index，那不是坑爹么。

然后，改过之后，出现另外一个问题，就是数组大小的问题。

我分配了一个存储数组，空间为10000大小的，可是，一直有个错误。

改过之后就好了。

以后多申请一点点嘛，代码如下

#include <iostream>

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char** argv) {
	int K;bool flag=false;
	int a[10010];
	scanf("%d",&K);
	for(int i=0; i<K; i++)
	{
		scanf("%d",&a[i]);
		if(a[i]>=0) flag=true;
	}
	int res=-1,begin=0,end=0,begin1=0;
	int max=0;
	for(int i=0; i<K; i++)
	{
		max+=a[i];
		if(max>res)
		{
			res=max;
			end=i;
			begin=begin1;
		}
		else if(max<0)
		{
			max=0;
			begin1=i+1;
		}
	}
	if(flag)
		printf("%d %d %d\n",res,a[begin],a[end]);
	else
		printf("%d %d %d\n",0,a[0],a[K-1]);
		
	return 0;
}

标签

#pat #最大子列和