A. Flipping Game

 http://codeforces.com/problemset/problem/327/A

题意：给一串01序列，只能进行一次区间反转，问1个数最大多少；

思路：以0开头找到0个数与1个数差值最大时就是该区间进行反转，当0个数小于1个数时重置(！！！)；

总结：思维还是不行

#include<bits/stdc++.h>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=1e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

int a[maxn],dp[maxn];
int n,m;
int main()
{
    int ans=0;
    int Max=-1;
    int lin=0;
    int yi=0;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        if(a[i]==1) ans++;
    }
    bool f=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]==0)
        {
            f=1;
            lin++;
        }
        else if(a[i]==1&&f)
        {
            yi++;
        }
        if(yi>=lin) yi=0,lin=0;
        Max=max(lin-yi,Max);
    }
    if(ans==n) ans--,Max=0;
    cout<<Max+ans<<endl;
    return 0;
}