CF 327A Flipping Game

/*

N很小, 模拟

*/

#include <iostream>#include <cstdio>#include <queue>#include <algorithm>#include <complex>#include <ctime>#include <cstdlib>#include <cstring>#include <string>#define INF 1e8#define MAX (int)1e6+ 5#define eps 1e-8using namespace std;int n;int a[MAX];;int getVal(int i, int j){    int ans = 0;    for(int k =  i - 1; k>= 0; k--){        ans += a[k];    }    for(int k = i; k <= j; k++){        ans += (a[k] + 1) % 2;    }    for(int k = j + 1; k < n; k++){        ans += a[k];    }    return ans;}int ans  = 0;int main(){    while(cin>>n){        for(int i   = 0; i < n; i++)            cin>>a[i];        ans = 0;        for(int i = 0; i < n; i++){            for(int j = i; j < n; j++){                int val = getVal(i, j);                ans = max(ans, val);            }        }        cout<<ans<<endl;    }    return 0;}