Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 143484 Accepted Submission(s): 33444
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题目大意 :给出几组数据,每组数据N个数并求出从第一个sum>=0的位置开始相加的最大和。解题思路 :定义数组把S【0】==Max;然后利用for循环把数据相加并和Max比较大小,记录下sum>=0的位置和最大sum位置。注意 :最后一组数据结果多只输出一组空行。附代码 :<span style="font-size:12px;">#include<stdio.h> int s[100100]; int main() { int i,t,n,temp,max,sum,start,end,j; scanf("%d",&n); for(i=1;i<=n;i++) { scanf("%d",&t); for(j=0;j<t;j++) { scanf("%d",&s[j]); } sum=s[0]; max=s[0]; temp=0; start=0; end=0; for(j=1;j<t;j++) { if(sum<0) { temp=j; sum=0; } sum+=s[j]; if(sum>max) { max=sum; end=j; start=temp; } } printf("Case %d:\n",i); printf("%d %d %d\n",max,start+1,end+1); if(i<n) printf("\n"); } return 0; } </span>