HDU 1003-Max Sum

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

 

Author

Ignatius.L

 

Recommend

We have carefully selected several similar problems for you:   1176  1087  1069  2084  1058 

#include <iostream>
using namespace std;
int main()
{
	int a[100005],left,right,n,cnt=1,m,temp;
	cin>>n;
	while(n--)
	{
	
		left=right=temp=1;
		int maxx=-1000;
		int sum=0;
		cin>>m;
		for(int i=1;i<=m;i++)
		{
			cin>>a[i];
			sum+=a[i];
			if(sum>maxx)
			{
				maxx=sum;
				left=temp;
				right=i;	
			}
			if(sum<0)
			{
				sum=0;
				temp=i+1;
			}	
		}
		printf("Case %d:\n",cnt++);
		printf("%d %d %d\n",maxx,left,right);
		if(n>0) printf("\n");
	}return 0;
}

right 记录 最大值时 的 终点下标(终点)

left是起点 

如果和小于0，则从下一位重置起始值与和。

刚刚接触 动态规划。

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

 

Author

Ignatius.L

 

Recommend

We have carefully selected several similar problems for you:   1176  1087  1069  2084  1058