hdu5586 Sum(dp)

题意：

#include"iostream"#include"cstdio"#include"cstring"using namespace std;int f(int x){    return (1890*x+143)%10007-x;}int b[100005],a[100005];int main(){    int n,i;    while(~scanf("%d",&n)&&n)    {       int res=0,max=0;       memset(a,0,sizeof(a));       memset(b,0,sizeof(b));       for(i=0;i<n;i++)       {           scanf("%d",&a[i]);           res+=a[i];           b[i]=f(a[i]);       }       for(i=1;i<n;i++)       {           if(b[i]+b[i-1]>b[i])              b[i]+=b[i-1];           if(b[i]>max)              max=b[i];       }       res+=max;       printf("%d\n",res);    }}