HDU 1003

最新推荐文章于 2021-07-27 21:50:39 发布

David_Yang

最新推荐文章于 2021-07-27 21:50:39 发布

阅读量628

点赞数

分类专栏：数据结构文章标签： HDU

本文链接：https://blog.csdn.net/yangchangda1/article/details/12747803

版权

数据结构专栏收录该内容

43 篇文章 0 订阅

订阅专栏

链接： http://acm.hdu.edu.cn/showproblem.php?pid=1003

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

#include <iostream>
using namespace std;
int main()
{
	int caseCount,n,temp,start,end,max,thisSum,x;
	cin>>caseCount;
	for (int i=1;i<=caseCount;i++)
	{
		cin>>n>>temp;
		thisSum=max=temp;
		start=end=x=1;
		for (int j=2;j<=n;j++)
		{   
			cin>>temp;
			if (thisSum+temp<temp)
				thisSum=temp,x=j;
			else
				thisSum+=temp;
			if (thisSum>max)
				max=thisSum,start=x,end=j;
		}
		cout<<"Case "<<i<<":"<<endl<<max<<" "<<start<<" "<<end<<endl;
		if (i!=caseCount)
			cout<<endl;
	}
	return 0;
}

代码比较简单，就不解释了。OO

DP经典问题，求最大连续字段和。此题的解法与王晓东的《计算机算法设计与分析》上的解法有一点不同。首先，王晓东教授假设当所有整数为负整数时定义其最大字段和为0，但是这题要求当所有数为负数时其最大字段和不为0（可为负）。于是，要在原来的算法基础上做一些改变。最基本的最大字段和问题的动态规划算法为：

int MaxSum(int n,int *a)
{
  int sum = 0,b=0;
  for(int i = 1;i <=n;i++){
      if(b>0) b+=a[i];
      else b = a[i];
   if(b > sum ) sum = b;
}
   return sum;
}