HDU 1003 Max Sum 解题报告

原题：

                                                                         Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 128157    Accepted Submission(s): 29687

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
   
   
   
   


   
   

题目大意：

   题目意思就是说给你一个数字串，然后求出连续的最大的数字之和，就是最大连续子序和

题目分析：

  这是一道DP题，简单来说，就是要模拟数字的行走过程。start表示最后的最大子序列中的开始下标，end表示最后的最大子序列的结束下标，maxNum表示最大子序列的数字总和，t表示模拟过程中的子序列开始下标

AC代码：

#include<iostream>

using namespace std;

int main(){

	int testCase = 0;
	cin>>testCase;
	for (int k=1;k<=testCase;k++) {
		int num = 0;
		cin>>num;
		int start = 1;
		int end = 1;
		int t = 1;
		int maxNum = -1001;
		int inputNum = 0;
		int sum = 0;
		for (int l=1;l<=num;l++) {
			cin>>inputNum;
			sum += inputNum;
			if(sum>maxNum) {
				maxNum = sum;
				start = t;
				end = l;
			}
			if(sum<0) {
				t = l+1;
				sum = 0;
			}
		}
		if(k!=1) cout<<endl;
		cout<<"Case "<<k<<":"<<endl;
		cout<<maxNum<<" "<<start<<" "<<end<<endl;
	}

	return 0;
}