Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 280243 Accepted Submission(s): 66535
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
附上我终于ac的代码。把之前1231那道题的代码改了改,求最大连续字段的函数巨坑Q^Q,wa了6次。最后改成学长发的模板给A啦。
不理解模板真可怕。一直wa。。。
#include<stdio.h>
#include<algorithm>
using namespace std;
int k,len,maxn,sum,s,e,kase;
void maxsum(int a[]){
s=0;
e=0;
sum=0;
maxn=-99999;
k=0;
for(int i=0;i<len;i++)
{
sum+=a[i];
if(maxn<sum){
maxn=sum;
s=k;
e=i;
}
if(sum<0){
sum=0;
k=i+1;
}
}
printf("Case %d:\n",kase++);
printf("%d %d %d\n",maxn,s+1,e+1);
}
int main()
{
int t,a[100002];
kase=1;
scanf("%d",&t);
while(t--)
{
scanf("%d",&len);
for(int i=0;i<len;i++)
{
scanf("%d",&a[i]);
}
maxsum(a);
if(t)
printf("\n");
}
}