Flipping Game

Flipping Game

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Iahub got bored, so he invented a game to be played on paper.

He writes n integers a1, a2, ..., an. Each of those integers can be either 0 or 1. He's allowed to do exactly one move: he chooses two indices i and j (1 ≤ i ≤ j ≤ n) and flips all values ak for which their positions are in range [i, j] (that is i ≤ k ≤ j). Flip the value of xmeans to apply operation x = 1 - x.

The goal of the game is that after exactly one move to obtain the maximum number of ones. Write a program to solve the little game of Iahub.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 100). In the second line of the input there are n integers: a1, a2, ..., an. It is guaranteed that each of those n values is either 0 or 1.

Output

Print an integer — the maximal number of 1s that can be obtained after exactly one move.

Sample test(s)

input

5
1 0 0 1 0

output

4

input

4
1 0 0 1

output

4

Note

In the first case, flip the segment from 2 to 5 (i = 2, j = 5). That flip changes the sequence, it becomes: [1 1 1 0 1]. So, it contains four ones. There is no way to make the whole sequence equal to [1 1 1 1 1].

In the second case, flipping only the second and the third element (i = 2, j = 3) will turn all numbers into 1.

/****
   昨晚有一场CF的比赛，看了一下第一题，想了大约一刻钟，想出来下面的算法。
   感觉O(n^2)不靠谱。但一看n的大小，我就知道了，这应该是这个比赛中最合适
   的算法。。。。
   
   这就是学长眼里的水题。。。。
   
   一刻钟才想出来，看来我的思维能力远远不够。。。。
   我还有好多没学，这样来看，实力还需提到。。。。。
   总之，目前还不能做比赛。。。
   
思路：
     枚举要改变的范围，从j到k，顶多算100*100轮~~~~
     
     刚才看了一下别人的题解，他强调了必须要进行一次变换，我当时没考虑，
     于是早上就提交了一遍代码，AC了。
     
     看了一遍题目，题目有个加粗的单词：exactly 
     昨晚上没注意。。
     
总结：
     我现在的思维能力远远不够。。。
     不果断，这是因为感觉自己不行才产生的。。。
     读题不仔细，英语阅读能力太差。。。
****/
#include <iostream>
#include <cstdio>

using namespace std;

int n;
int a[101]={0},s[101]={0};


void read()
{
    int i;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        if(a[i])
            s[i]=s[i-1]+1;
        else
            s[i]=s[i-1];
    }
}
void deal()
{
    int j,k;
    int Max=-1;
    for(j=1;j<=n;j++)
        for(k=1;k<=j;k++)
    {
        int S=j-k+1;
        S-=s[j]-s[k-1];
        S+=s[n]-s[j]+s[k-1];
        if(S>Max)
            Max=S;
    }
    cout<<Max<<endl;
}
int main()
{   read();
    deal();
    return 0;
}