Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 160148 Accepted Submission(s): 37497
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
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define inf 0x7ffffff
#define maxn 100005
int n,m;
int arr[maxn];
int main()
{
scanf("%d",&n);
for(int t = 1; t <= n; t++){
scanf("%d",&m);
for(int j = 0; j < m; j++){
scanf("%d",&arr[j]);
}
int st= 0,ed = 0,tmp = 0;
int sum = -inf;
int maxnum = -inf;
for(int i = 0; i < m;i++){
if(sum < 0){
tmp = i;
sum = 0;
}
sum += arr[i];
if(sum > maxnum){
st = tmp;
ed = i;
maxnum = sum;
}
}
if(t >1){
printf("\n");
}
printf("Case %d:\n",t);
printf("%d %d %d\n",maxnum,st+1,ed+1);
}
return 0;
}