BestCoder Round #64 (div.2) 1002 Sum HDU 5586 联机算法

来源：互联网发布：如何成为网络作家编辑：程序博客网时间：2024/05/20 06:25

Sum

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

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

210000 999951 9999 1 9999 1

Sample Output

1999922033

Source

BestCoder Round #64 (div.2)

出题人：令 ${A}_{i}=f({A}_{i})-{A}_{i}$ ,然后求一遍最大连续子序列和就能知道最多能增加的值。

联机算法 :

0 0