Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 147262 Accepted Submission(s): 34418
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
Recommend
We have carefully selected several similar problems for you:
1176
1069
2084
1058
1203
设dp[i] 表示 以元素i结尾时的最大值,显然 dp[i] = max (dp[i-1] + arr[i], arr[i] )
按这个方程可以找到最大值和产生最大值的序列的结束位置,但还需要一个开始位置,
求法是这样的,观察方程,只有当dp[i-1] <=0 时,dp[i] 才会取arr[i],所以从结束位置开始往前找,如果dp[i] >=0 说明 dp[i + 1] 一定是 dp[i] + arr[i+1],所以一定连在一起,反之,如果dp[i]<0,那么dp[i + 1] 一定是 arr[i+1],显然就从这里断开了,所以发现dp[i]<0就可以break了。再往前就是其他序列了。
设dp[i] 表示 以元素i结尾时的最大值,显然 dp[i] = max (dp[i-1] + arr[i], arr[i] )
按这个方程可以找到最大值和产生最大值的序列的结束位置,但还需要一个开始位置,
求法是这样的,观察方程,只有当dp[i-1] <=0 时,dp[i] 才会取arr[i],所以从结束位置开始往前找,如果dp[i] >=0 说明 dp[i + 1] 一定是 dp[i] + arr[i+1],所以一定连在一起,反之,如果dp[i]<0,那么dp[i + 1] 一定是 arr[i+1],显然就从这里断开了,所以发现dp[i]<0就可以break了。再往前就是其他序列了。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int dp[1000010];
int arr[1000010];
int main()
{
int t, k;
scanf("%d", &t);
int icase = 1;
bool flag = false;
while(t--)
//while(~scanf("%d", &k), k)
{
if(flag)
printf("\n");
else
flag = true;
scanf("%d", &k);
for(int i = 0;i < k; i++)
scanf("%d", &arr[i]);
memset( dp, 0, sizeof(dp) );
int s, e, ans = -0x3f3f3f;
for(int i = 0; i < k; i++)
{
if(i == 0)
dp[i] = arr[i];
else
dp[i] = max(dp[i - 1] + arr[i], arr[i]);
if(dp[i] > ans)
{
ans = dp[i];
e = i;
}
}
s = e;
for(int i = e - 1; i >= 0; i--)
{
if(dp[i] >= 0)
s = i;
else
break;
}
printf("Case %d:\n", icase++);
printf("%d %d %d\n", ans, ++s, ++e);
}
return 0;
}