Submission #1662063

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
int n,a[100010];

int main(){
	cin >> n;
	REP(i,1,n+1) cin >> a[i];
	a[0]=a[n+1]=4;
	
	int ma=0;
	REP(i,1,n+1){
		REP(j,1,4){
			int r=i-1,l=i+1,s=0,c=1,co=j;
			while(1){
				while(a[r]==co) r--,c++;
				while(a[l]==co) l++,c++;
				if(c<4) break;
				s+=c,c=0;
				if(a[r]!=a[l]) break;
				co=a[r];
			}
			ma=max(ma,s);
		}
	}
				
	cout << n-ma << endl;
	return 0;
}

Submission Info

Judge Result