Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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
输入n个整数,求这些整数中 ”连续和“ 最大的区间。输出最大的和以及区间的始末位置。
解题思路:
用a数组记录每个整数,用dp数组记录每个数字的最大和的值,设当前的位置为i,当dp[i-1]>=0时,则更新 dp[i]=dp[i-1]+a[i],否则更新dp[i]=a[i].
代码:
#include<iostream>
#include<cstdio>
using namespace std;
const int maxN=100010;
int n,a[maxN];
void dp(){
int pos=0,maxsum,dp[maxN],temp=0;
dp[0]=a[0];
maxsum=dp[0];
for(int i=1;i<n;i++){
if(dp[i-1]>=0) {
dp[i]=dp[i-1]+a[i];
if(dp[i]>maxsum) {
maxsum=dp[i];temp=pos=i;
}
}
else {
dp[i]=a[i];
if(dp[i]>maxsum){
maxsum=dp[i];temp=pos=i;
}
}
}
for(int i=temp;i>=0;i--){
if(dp[i]>=0) pos=i;
else break;
}
printf("%d %d %d\n",maxsum,pos+1,temp+1);
}
int main(){
int T,casen=0;
scanf("%d",&T);
while(++casen<=T){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
if(casen>1) printf("\n");
printf("Case %d:\n",casen);
dp();
}
return 0;
}