Submission #2383500

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#include <fstream>
#define FI first
#define SE second
#define VE vector<int>
#define PB push_back
#define PA pair<int,int>
#define MA make_pair
#define LL long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
#define POS(i) cout<<(i?"POSSIBLE":"IMPOSSIBLE")<<endl
using namespace std;
//
const int INF=1e9+7;
const int MOD=1e9+7;
//

int main(){
    int n; cin>>n;
    int fc;//first color
    int cc,cc2;//current color
    cin>>fc;
    cc=fc;
    int a[100001]={0}, k=0;
    a[0]++;
    FOR(i,1,n){
        cin>>cc2;
        if(cc!=cc2){
            k++;
        }
        a[k]++;
        cc=cc2;
    }
    if(k==0){
        cout<<-1<<endl;
        exit(0);
    }
    if(cc2==fc){
        a[0]+=a[k];
        a[k]=0;
        k--;
    }
    int M=0;
    FOR(i,0,k+1){
        M=max(M,a[i]);
    }
    cout<<(M+1)/2<<endl;
    return 0;
}

Submission Info

Judge Result