杭电ACM----------1003 Max Num

最新推荐文章于 2024-09-21 14:53:30 发布

我只是一只狗

最新推荐文章于 2024-09-21 14:53:30 发布

阅读量1.2k

点赞数

分类专栏： c++ 文章标签： c++ 算法

本文链接：https://blog.csdn.net/u011619422/article/details/46610453

版权

c++ 专栏收录该内容

229 篇文章 7 订阅

订阅专栏

Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
 

Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
 

Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
 

Sample Input
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5
 

Sample Output
Case 1:
14 1 4

Case 2:
7 1 6

具体问题如上，其实有点要注意的就是：

5 6 -1 5 4 -7

代表的是5个元素6 -1 5 4 -7

然后求最大子序列，本题用到的是动态规划的知识来解决这个问题就比较简单了

具体代码如下：

#include <iostream>  
using namespace std;

int main()
{
	int t, n, temp, pos1, pos2, x, i, j , now , max;
	cin >> t; //共有的组数
	for (i = 1; i <= t; i++)
	{
		cin >> n >> temp; //输入的是元素的个数 和第一个元素
		pos1 = pos2 = x = 1;
		now = max = temp;
		for (j = 2; j <= n; j++)
		{
			cin >> temp;
			if (now + temp < temp){
				now = temp;   //判断前面数的总和是否是负数，如果是，则用当前数替换now的值
				x = j;
			}
			else
			{
				now += temp;
			}

			if (now > max){
				max = now;
				pos1 = x;
				pos2 = j;
			}

		}

		cout << "Case " << i << ":" << endl << max << " " << pos1 << " " << pos2 << endl;
		if (i != t)
			cout << endl;

	}


	return 0;
}