杭电5586 Sum（dp）

Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 676    Accepted Submission(s): 357

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 .

 

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

BestCoder Round #64 (div.2)

 

Recommend

hujie   |   We have carefully selected several similar problems for you:   5589  5588  5587  5585  5584 

 

变相的最大字段和，附代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[110000],i,j,k,l,m,n,b[110000],c[110000];
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		int ans=0;
		for(i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			b[i]=(a[i]*1890+143)%10007;
			c[i]=b[i]-a[i];//c数组用来储存差值 
			ans+=a[i];//先求和 
		}
		int sum=0;
		int Max=0;	
		for(i=0;i<n;i++)//最大字段和代码 
		{
			if(sum<=0)
			sum=c[i];
			else
			sum+=c[i];
			Max=max(sum,Max);//找到c数组里边的最大字段和 
		}
		printf("%d\n",Max+ans);//输出结果 
	}
}