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
思路
题目要求的是连续数字字段的最大和,并输出该字段的起始位置和终止位置。定义maxsum和sum两个变量,如果sum比maxsum大则替换maxsum,并刷新起始位置和终止位置,如果sum小于0,则刷新sum并将临时变量k换到下一位。
AC代码
#include <cstdio>
#include <iostream>
using namespace std;
int a[100005];
int main(){
int t,n,sum,maxsum,start,end,k;
scanf("%d",&t);
for(int j=1;j<=t;j++){
sum=0;
maxsum=-1001;
start=0;
end=0;
k=1;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++){
sum+=a[i];
if(sum>maxsum){
maxsum=sum;
start=k;
end=i+1;
}
if(sum<0){
sum=0;
k=i+2;
}
}
printf("Case %d:\n%d %d %d\n",j,maxsum,start,end);
if(j!=t){
printf("\n");
}
}
return 0;
}