Submission #2150160

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define VSORT(v) sort(v.begin(), v.end())
#define DVSORT(v) sort(v.begin(), v.end(),greater<int>())
#define SORT(v, n) sort(v, v+n)
#define DSORT(v,n) sort(v, v+n,greater<int>())
#define vi vector<int>
#define pb push_back
#define P pair<int,int>
#define Pll pair<ll,ll>

template <class T> void chmin(T&a,const T&b) { a = min(a,b); }
template <class T> void chmax(T&a,const T&b) { a = max(a,b); }
 
void print(){cout<<endl;}
template <class Head, class... Tail>
void print(Head&& h,Tail&&... t){ 
	if(sizeof...(t)==0)
		cout<<h;
	else
		cout<<h<<' ';
	print(move(t)...);
}
 
const double EPS =1e-9;
const int INF =2e+9;
const ll INFL =9e+18;
const long MOD =1e+9+7;
#define PI 3.14159265258979

int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};

int fn(string S,char c,int cn){
	string S2(S.length()-1,'a');
	bool flug=false;

	REP(i,(int)S.length()) if(S[i]!=c) flug=true;
	
	if(flug){
		REP(i,(int)S.length()-1){ 
			if(S[i]==c||S[i+1]==c) S2[i]=c;
			else S2[i]=S[i];
		}
		return fn(S2,c,cn+1);
	}else{
		return cn;
	}
}

int main(void){
	string S;
	int min=INF;
	
	cin>>S;
	REP(i,(int)S.length()) chmin(min,fn(S,S[i],0));
	print(min);

	return 0;
}

Submission Info

Judge Result