A. Flipping Game DP水题

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 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 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 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. 

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.

我分析了一下 其实代码可以更短

 思路就是 10010

我找出0开头且连续之后统计0和1的个数分别为 n,m 当n-m的值最大的时候 就保存为最大值 如果n-m小于0了 就让他为0

之所以max=-1 是因为至少也要交换一组的数据

#include <iostream>
#include <cstring>
int main()
{
    int n,t,sum=0,max=-1,ans=0;
    std::cin>>n;
    for(int i=0;i<n;i++)
    {
        std::cin>>t;
        if(t==0)
        {
            ans++;
            if(ans>max) max=ans;
        }
        else
        {
            ans--;
            if(ans<0) ans=0;
        }
        if(ans<max||ans==0)
        sum+=t;
    }
    std::cout<<sum+max;
    return 0;
}