#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std ;
const int mod = 10007 ;
const int maxn = 1e5+10 ;
int a[maxn] ;
int b[maxn] ;
int s[maxn] ;
int main()
{
int n ;
while(~scanf("%d" , &n)){
int sum = 0 ;
for(int i = 1;i <= n;i++){
scanf("%d" , &a[i]) ;
b[i] = (1890*a[i]+143)%mod ;
s[i] = b[i] - a[i];
sum += a[i] ;
}
int ans = 0 ;
int aa = 0 ;
for(int i = 1;i <= n;i++){
aa += s[i];
if(aa<0)aa = 0 ;
ans = max(ans , aa) ;
}
printf("%d\n" , ans+sum) ;
}
return 0 ;
}
hdu5586Sum
最新推荐文章于 2019-12-02 19:49:42 发布