HDOJ 5586 Sum【最大子段和动态规划 O(n)】

最新推荐文章于 2020-09-26 22:19:04 发布

非常可乐（이녕）

最新推荐文章于 2020-09-26 22:19:04 发布

阅读量375

点赞数

分类专栏：动态规划文章标签：最大子段和动态规划

本文链接：https://blog.csdn.net/wyjwyl/article/details/51264212

版权

动态规划专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Sum

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

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

Source

BestCoder Round #64 (div.2)

先预处理，可得出变换前后的差值，求这些差值的最大子段和，然后再加上原先的总和。

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define maxn 100010
#define MOD 10007
using namespace std;
__int64 a[maxn];
int s[maxn];
int r[maxn];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int sum=0;
        for(int i=1;i<=n;++i)
        {
            scanf("%I64d",&a[i]);
            s[i]=(a[i]*1890+143)%MOD;
            r[i]=s[i]-a[i];
            sum+=a[i];
        }
        int tem=0,ans=0;
        for(int i=1;i<=n;++i)
        {
            if(tem>=0)
                tem=(tem+r[i]);
            else
                tem=r[i];
            if(tem>ans)
                ans=tem;
        }
        printf("%d\n",ans+sum);
    }
    return 0;
}