Maximum sum
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 47392 | Accepted: 14601 |
Description
Given a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:
Your task is to calculate d(A).
Input
The input consists of T(<=30) test cases. The number of test cases (T) is given in the first line of the input.
Each test case contains two lines. The first line is an integer n(2<=n<=50000). The second line contains n integers: a1, a2, ..., an. (|ai| <= 10000).There is an empty line after each case.
Output
Print exactly one line for each test case. The line should contain the integer d(A).
Sample Input
1
10
1 -1 2 2 3 -3 4 -4 5 -5
Sample Output
13
Hint
In the sample, we choose {2,2,3,-3,4} and {5}, then we can get the answer.
Huge input,scanf is recommended.
解题思路:
这里我们分别从前往后(dp1)和从后往前(dp2)求解最大连续子串和,然后设置一个rtm[i]代表取后i个元素之中最大连续子串的和,最大的dp1[i - 1] + rtm[i]。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=100000+100;
const int inf=0x3fffffff;
int n;
int a[MAXN],b[MAXN],dp1[MAXN],dp2[MAXN];
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
dp1[0]=dp2[n+1]=-inf;
b[0]=b[n+1]=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[i]=max(0,b[i-1])+a[i];
dp1[i]=max(dp1[i-1],b[i]);
}
for(int i=n;i>=1;i--)
{
b[i]=max(0,b[i+1])+a[i];
dp2[i]=max(dp2[i+1],b[i]);
}
int ans=-inf;
for(int i=1;i<n;i++)
ans=max(ans,dp1[i]+dp2[i+1]);
printf("%d\n",ans);
}
return 0;
}
Max Sequence
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 18867 | Accepted: 7886 |
Description
Give you N integers a1, a2 ... aN (|ai| <=1000, 1 <= i <= N).
You should output S.
Input
The input will consist of several test cases. For each test case, one integer N (2 <= N <= 100000) is given in the first line. Second line contains N integers. The input is terminated by a single line with N = 0.
Output
For each test of the input, print a line containing S.
Sample Input
5 -5 9 -5 11 20 0
Sample Output
40
解题思路
和上一题思路一样
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=100000+100;
const int inf=0x3fffffff;
int n;
int a[MAXN],b[MAXN],dp1[MAXN],dp2[MAXN];
int main()
{
while(~scanf("%d",&n) && n)
{
scanf("%d", &n);
dp1[0]=dp2[n+1]=-inf;
b[0]=b[n+1]=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[i]=max(0,b[i-1])+a[i];
dp1[i]=max(dp1[i-1],b[i]);
}
for(int i=n;i>=1;i--)
{
b[i]=max(0,b[i+1])+a[i];
dp2[i]=max(dp2[i+1],b[i]);
}
int ans=-inf;
for(int i=1;i<n;i++)
ans=max(ans,dp1[i]+dp2[i+1]);
printf("%d\n",ans);
}
return 0;
}