codeforces——327A——Flipping Game

A. 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 a₁, a₂, ..., a_n. Each of those integers can be either 0 or 1. He's allowed to do exactly one move: he chooses two indicesi and j (1 ≤ i ≤ j ≤ n) and flips all valuesa_k for which their positions are in range[i, j] (that is i ≤ k ≤ j). Flip the value of x means 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 aren integers: a₁, a₂, ..., a_n. 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.

Examples

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.

问转换一个范围内元素的值，对多可以使得所有的值和为一个最大值，输出最大值

先模拟 转换 后 值 的变化，再计算转换后的结果。。当然~遍历也可以。

遍历就应该算水题了吧。

#include <iostream>
#include <deque>
#include <cstring>
#include <algorithm>
#include <stdio.h>
#include <map>
#include <vector>
#include <iomanip>
#include <string>
#include <cstring>
#include <functional>
#include <queue>
#define MIN -1e9
using namespace std;
int main()
{
    int n;
    while(cin>>n)
    {
        vector<int>vec1;//用于模拟值的变化，并将数组简化
        int temp=0,t=n;
        while(t--)
        {
            bool temp2;
            cin>>temp2;
            if(temp*(2*temp2-1)>0)
            {
                vec1.push_back(temp);
                temp=0;
            }
            if(temp2)
                temp-=1;
            else
                temp+=1;
        }
        vec1.push_back(temp);
        int ans=0,sum=0,sum2=0;
        vector<int>::iterator it;
        for(it=vec1.begin(); it!=vec1.end(); it++)
        {
            sum+=*it;
            sum2+=(*it<0)*(-*it);
            if(sum<0)
                sum=0;
            else if(sum>ans)
                ans=sum;
        }
        cout<<(ans+sum2)-(sum2==n)<<endl;
//ans是可获得转换值收益的最大情况，sum2是原来的值，之后的是考虑全是1的情况（为此WA两次）( ๑ŏ ﹏ ŏ๑ )
    }
    return 0;
}