7-31 Maximum Subsequence Sum (25分)暴力，测试点分析

最新推荐文章于 2022-02-25 20:55:08 发布

lyj%

最新推荐文章于 2022-02-25 20:55:08 发布

阅读量685

点赞数 1

本文链接：https://blog.csdn.net/qq_44461900/article/details/104267569

版权

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

测试点提示
0 sample换1个数字。有正负，负数开头结尾，有并列最大和
1 最大和序列中有负数
2 并列和对应相同i但是不同j，即尾是0
3 1个正数
4 全是负数
5 负数和0
6 最大和前面有一段是0
7 最大N

这个点好像不太对应这道题，我刚开始有两个点不对，删了几行代码，以为不对，提交之后居然过了，但是我觉得我的不太对，emmm
可能是对测试点的意思理解的有偏差

#include <bits/stdc++.h>
#define pb push_back
#define mem(a,b) memset(a,b,sizeof a)
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
int main()
{
//	freopen("D:\\LYJ.txt","r",stdin);
	int n,f=0,maxx=-1;
	cin>>n;
	vector<int> vi(n);
	for(int i=0;i<n;i++)
	{
		cin>>vi[i];
		if(vi[i]>=0) f=1;//刚开始没写等于0
	}
	if(0==f)
	{
		cout<<"0 "<<vi[0]<<" "<<vi[n-1];
		return 0;
	}
	int sum=0,mi=0,mj=0;
	for(int i=0;i<n;i++)
	{
		sum=0;
		for(int j=0;i+j<n;j++)
		{
			sum+=vi[i+j];
			if(sum>maxx)
			{
				maxx=sum;
				mi=i;
				mj=i+j;
			}
		}
	}
	cout<<maxx<<" "<<vi[mi]<<" "<<vi[mj];
	return 0;
}