Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 150602 Accepted Submission(s): 35169
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 T;//记录数据的组数。 cin>>T; int i=2; int Ti=0; for(int p=1;p<=T;p++) { Ti++; int n,data;//n为第一组数据的组数,data为第一组数据的第一个数。 cin>>n>>data; int S_pos,E_pos,x;//S_pos指开始时的位置,同样,E_pos值结束时的位置。 S_pos=E_pos=x=1; //要进行数据的比对,如果第二个数据+第一个数据小于第二个数据,则可以更新最大和的起始位置。 int now=data;//now代表的是随时进行更新的一个当前的和值。 //应该还要进行一个max的定义,好进行与当前的和值的比对,以随时进行更新。 int max=data; for(i=2;i<=n;i++) { //开始录入第二至最后一个数据。 cin>>data; if(now+data<data) { //进行位置和当前值的更新。 now=data; x=i; } else { now=now+data; } if(now>max) { max=now; S_pos=x; E_pos=i; } } //注意输出的格式要求两行中间还要输出一行空格。 cout<<"Case "<<Ti<<":"<<endl; cout<<max<<" "<<S_pos<<" "<<E_pos<<endl; if(p!=T) { cout<<endl; } } return 0; }