Description
Here are n numbers.
You have a magic : first , you choose a interval [l,r],and then each Si(l<=i<=r) will be ( 10 – Si ) % 10.
You can use the magic at most once to make sum of all the numbers to be maximum.
What is the maximum sum you can get?
Input
First line of each case contains a number n.(1 ≤ n ≤ 1 000 000).
Next line contains n numbers without space-separated. Each position corresponds to a number of 0-9.
Output
Output the answer on a single line for each case.
Sample Input
10
3775053808
10
2580294019
10
4701956095
Sample Output
50
50
54
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
char a[1000005];
int b[1000005];
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
scanf("%s",a);
long long cnt=0,mx=0,sum=0;
for (int i=0;i<n;i++)
cnt=cnt+a[i]-'0'; //cnt记录所有位数之和
for (int i=0;i<n;i++)
b[i]=(10-(a[i]-'0'))%10-(a[i]-'0'); //数组b记录变化后比原来的数增加的量(可为负)
sum=b[0];
for (int i=1;i<n;i++)
{
if (sum+b[i]<b[i])
sum=b[i];
else sum=sum+b[i];
mx=max(mx,sum); //mx为数组b的最大连续子序列之和
}
printf("%lld\n",mx+cnt);
}
return 0;
}