1007. Maximum Subsequence Sum (25)

原创 2016年08月31日 15:16:00

1007. Maximum Subsequence Sum (25)

 

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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

 

 

 

#include <stdio.h>
#include <stdlib.h>

int main()
{
	int k ;
	int maxi,maxj;
	int nowi,nowj,i,num;
	int sum,maxsum,flag=0;
	scanf("%d",&k);
	maxsum = -1;
	sum = 0;
	for(i=0;i<k;i++)
	{
		scanf("%d",&num);
		if(!num)
		{
			flag = 1;
		}
		if(sum == 0 )
		{
			nowi = num;
		}
		sum += num;
		nowj = num;
		if(sum < 0)
		{
			sum = 0;
		}
		if(sum > maxsum)
		{
			maxsum = sum;
			maxi = nowi;
			maxj = nowj;
		}
	}
	if(maxsum == 0)
	{
		maxj = nowj;
	}
	if(flag && maxsum==0)
	{
		maxi = 0;
		maxj = 0;
	}
	printf("%d %d %d",maxsum,maxi,maxj);
	//system("pause");
	return 0;
}


 

 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

PAT-1007. Maximum Subsequence Sum (25)

Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni...

浙江大学PAT上机题解析之1007. Maximum Subsequence Sum (25)

Given a sequence of K integers { N1, N2, ..., NK }.  A continuous subsequence is defined to be { Ni,...

PAT (Advanced Level) 1007. Maximum Subsequence Sum (25) 最大连续子数组,一次遍历,stack辅助

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, ...

PAT_A 1007. Maximum Subsequence Sum (25)

1007. Maximum Subsequence Sum (25)
  • scylhy
  • scylhy
  • 2016年11月20日 21:31
  • 141

1007. Maximum Subsequence Sum (25) -- 动态规划

1007. Maximum Subsequence Sum (25)题目地址Given a sequence of K integers { N1, N2, …, NK }. A continuous...

PAT甲级 1007.Maximum Subsequence Sum(25) 题目翻译与答案

1007.最大的子序列和 有一个包含K个整数{ N1, N2, ..., NK }的序列。一个连续的子序列被定义为 { Ni, Ni+1, ..., Nj } (1...

pat 1007. Maximum Subsequence Sum (25)

1007. Maximum Subsequence Sum (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 ...

pat PAT (Advanced Level) Practise 1007. Maximum Subsequence Sum (25)

1007. Maximum Subsequence Sum (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 ...

【PAT】1007. Maximum Subsequence Sum (25)

题目链接:http://pat.zju.edu.cn/contests/pat-a-practise/1007 分析: (1)求最大连续子序列,最终输出最大子序列值以及子序列起始和终止元素。如果数...

PAT 1007. Maximum Subsequence Sum (25)(dp动态规划)

题目1007. Maximum Subsequence Sum (25)时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1007. Maximum Subsequence Sum (25)
举报原因:
原因补充:

(最多只允许输入30个字)