Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 176951 Accepted Submission(s): 41237
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
思路,计算出前n项和最大的减去前n项和最小的就是最大的数值,刷新最小值的时候标记最小值的位置,刷新最大值的时候再更新l,r;
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define maxn 100010
#define inf 0xffffff
int dp[maxn];
int main()
{
int t,n;
scanf("%d",&t);
for(int k = 1; k <= t; k++)
{
scanf("%d",&n);
int x;
for(int i = 1; i <= n; i++)
{
scanf("%d",&x);
dp[i] = dp[i - 1] + x;
}
int Min = inf,Max = -inf,l,r,s;
for(int i = 1; i <= n; i++)
{
if(dp[i - 1] < Min) {Min = dp[i - 1]; s = i; }
if(dp[i] - Min > Max)
{
Max = dp[i] - Min;
r = i;
l = s;
}
}
if(k^t)
printf("Case %d:\n%d %d %d\n\n",k,Max,l,r);
else
printf("Case %d:\n%d %d %d\n",k,Max,l,r);
}
return 0;
}