关闭

1007. Maximum Subsequence Sum (25)

78人阅读 评论(0) 收藏 举报
分类:

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


----------------华丽的分割线---------------------

分析:

当只有负数和0时,应该输出“0 0 0”

代码:

#include<cstdio>
#include<cstdlib>

#define Maxn 10001

int input[Maxn];

bool hasPositive = false;
bool hasNegtive = false;
bool hasZero = false;

int main(void)
{
	int K,i;
	scanf("%d",&K);
	for(i=0;i<K;++i)
	{
		scanf("%d",&input[i]);
	}
	int leftindex = 0;
	int rightindex = K-1;
	int countnum = 0;
	int maxsum = 0;
	int thissum = 0;
	for(i=0;i<K;++i)
	{
		if(input[i] == 0)
			hasZero = true;
		thissum += input[i];
		++countnum;
		if(thissum > maxsum)
		{
			hasPositive = true;
			maxsum = thissum;
			rightindex = i;
			leftindex = rightindex - countnum+1;
			continue;
		}
		if(thissum < 0)
		{
			hasNegtive = true;
			thissum = 0;
			countnum = 0;
		}
	}
	if(hasZero && hasNegtive && (!hasPositive))
	{
		printf("0 0 0");
	}
	else
	{
		printf("%d %d %d",maxsum,input[leftindex],input[rightindex]);
	}
	system("pause");
	return 0;
}


0
0

猜你在找
【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐(算法+实战)--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮
查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:13272次
    • 积分:1086
    • 等级:
    • 排名:千里之外
    • 原创:102篇
    • 转载:0篇
    • 译文:0篇
    • 评论:2条
    最新评论