Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1354 Accepted Submission(s): 684
Problem Description
There is a number sequence
A1,A2....An
,you can select a interval [l,r] or not,all the numbers
Ai(l≤i≤r)
will become
f(Ai)
.
f(x)=(1890x+143)mod10007
.After that,the sum of n numbers should be as much as possible.What is the maximum sum?
Input
There are multiple test cases.
First line of each case contains a single integer n. (1≤n≤105)
Next line contains n integers A1,A2....An . (0≤Ai≤104)
It's guaranteed that ∑n≤106 .
First line of each case contains a single integer n. (1≤n≤105)
Next line contains n integers A1,A2....An . (0≤Ai≤104)
It's guaranteed that ∑n≤106 .
Output
For each test case,output the answer in a line.
Sample Input
2 10000 9999 5 1 9999 1 9999 1
Sample Output
19999 22033
Source
Recommend
#include<stdio.h>
#include<string.h>
int main()
{
int n,i,sum;
int a[100010],b[100010];
int dp[100010];
while(~scanf("%d",&n))
{
memset(dp,0,sizeof(dp));
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
b[i]=(1890*a[i]+143)%10007-a[i];
}
int max;
max=dp[0]=b[0];
for(i=1;i<n;i++)
{
dp[i]=(b[i]>(dp[i-1]+b[i])?b[i]:(dp[i-1]+b[i]));
max=(max>dp[i]?max:dp[i]);
}
if(max<0)
printf("%d\n",sum);
else
printf("%d\n",sum+max);
}
return 0;
}
#include<string.h>
int main()
{
int n,i,sum;
int a[100010],b[100010];
int dp[100010];
while(~scanf("%d",&n))
{
memset(dp,0,sizeof(dp));
sum=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
b[i]=(1890*a[i]+143)%10007-a[i];
}
int max;
max=dp[0]=b[0];
for(i=1;i<n;i++)
{
dp[i]=(b[i]>(dp[i-1]+b[i])?b[i]:(dp[i-1]+b[i]));
max=(max>dp[i]?max:dp[i]);
}
if(max<0)
printf("%d\n",sum);
else
printf("%d\n",sum+max);
}
return 0;
}