Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 294085 Accepted Submission(s): 69826 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
|
题意:给定一个数组,求连续子数组的和的最大值,以及起始位置与结束位置。
思路:DP,,, 设当前和为 now , now = max(now + a[i],a[i])。
AC代码:
#include<bits/stdc++.h>
using namespace std;
#define cas(t) int t; scanf("%d",&t);
const int maxn = 1e6 + 10;
int a[maxn];
int main()
{
cas(t);
int c = 1;
while(t --){
int n; scanf("%d",&n);
for(int i = 1;i <= n;i ++)
scanf("%d",&a[i]);
int beg,en,maxsum,now,p;
p = beg = en = 1; ///起始时,当然都为起始位置 1
maxsum = now = a[1]; /// 赋初值
for(int i = 2;i <= n;i ++){
if(now + a[i] < a[i]){
now = a[i];
p = i;
}else {
now += a[i];
}
if(now > maxsum){
maxsum = now;
en = i;
beg = p;
}
}
printf("Case %d:\n",c ++);
printf("%d %d %d\n",maxsum,beg,en);
if(t) printf("\n");
}
return 0;
}