Max Sequence
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 16511 | Accepted: 6921 |
Description
Give you N integers a1, a2 ... aN (|ai| <=1000, 1 <= i <= N).
You should output S.
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
Source
POJ Monthly--2005.08.28,Li Haoyuan
ACcode:
#include <cmath>
#include <cstdio>
#include <iostream>
#define maxn 100000+5
using namespace std;
int a[maxn],dp[maxn],pd[maxn],sum;
int main(){
int loop,n;
while(scanf("%d",&n)&&n){
scanf("%d",&a[1]);
dp[0]=pd[n+1]=-maxn;
dp[1]=a[1];
for(int i=2;i<=n;++i){
scanf("%d",&a[i]);
dp[i]=max(dp[i-1]+a[i],a[i]);
}
pd[n]=a[n];
for(int i=n-1;i>0;--i){
pd[i]=max(pd[i+1]+a[i],a[i]);
}
for(int i=1,j=n-1;i<=n;++i,--j){
dp[i]=max(dp[i],dp[i-1]);
pd[i]=max(pd[i],pd[i+1]);
// printf("dp[%d]==%d pd[%d]==%d\n",i,dp[i],i,pd[i]);
}
sum=dp[1]+pd[2];
for(int i=2;i<=n;++i)
sum=max(sum,dp[i]+pd[i+1]);
printf("%d\n",sum);
}
return 0;
}
Maximum sum
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 36441 | Accepted: 11309 |
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.
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.
Huge input,scanf is recommended.
Source
POJ Contest,Author:Mathematica@ZSU
ACcode:
#include <cmath>
#include <cstdio>
#include <iostream>
#define maxn 50000+5
using namespace std;
int a[maxn],dp[maxn],pd[maxn],sum;
int main(){
int loop,n;
scanf("%d",&loop);
while(loop--){
scanf("%d",&n);
scanf("%d",&a[1]);
dp[0]=pd[n+1]=-maxn;
dp[1]=a[1];
for(int i=2;i<=n;++i){
scanf("%d",&a[i]);
dp[i]=max(dp[i-1]+a[i],a[i]);
}
pd[n]=a[n];
for(int i=n-1;i>0;--i){
pd[i]=max(pd[i+1]+a[i],a[i]);
}
for(int i=1,j=n-1;i<=n;++i,--j){
dp[i]=max(dp[i],dp[i-1]);
pd[i]=max(pd[i],pd[i+1]);
// printf("dp[%d]==%d pd[%d]==%d\n",i,dp[i],i,pd[i]);
}
sum=dp[1]+pd[2];
for(int i=2;i<=n;++i)
sum=max(sum,dp[i]+pd[i+1]);
printf("%d\n",sum);
}
return 0;
}