Submission #1965676

---

Source Code Expand

#include <iostream>
#include <vector>
#include <set>
using namespace std;

int n;


typedef pair<int,int> P;

int a[10000];

int rec(int l,int r)
{
	if(l <= -1 || n <= r) return 0;

	int cl = a[l];
	int cr = a[r];

	if(cl != cr) return 0;
	int cou = 2;
	--l;
	while(a[l] == cl && 0 <= l)
	{
		--l;
		cou++;
	}
	r++;
	while(a[r] == cr && r < n)
	{
		++r;
		cou++;
	}
	if(cou < 4) return 0;
	return cou + rec(l,r);
}


int main()
{
	cin >> n;
	for(int i = 0;i < n;i++) cin >> a[i];
	
	int result = 0;
	for(int i = 1;i < n - 1;i++)
	{
		int before = a[i];
		a[i] = a[i - 1];

		result = max(result , rec(i - 1,i));

		a[i] = a[i + 1];

		result = max(result , rec(i - 1,i));

		a[i] = before;
	}

	cout << n - result << endl;
	return 0;
}

Submission Info

Judge Result