Submission #1359357

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define F first
#define S second

const int MAXN = 100 + 3;

int n;
string s;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> s; n = s.size();

	int ans = 1e9;
	for (char c = 'a'; c <= 'z'; c++){
		bool fl = 0;
		for (char ch:s)
			if (ch == c) fl = 1;
		if (!fl) continue;

		string t = s;
		int ret = 0;
		while (1){
			bool fail = 0;
			for (char ch:t)
				if (ch != c) fail = 1;
			if (!fail) break;

			string temp;
			for (int i = 0; i + 1 < t.size(); i++)
				if (t[i] == c || t[i+1] == c)
					temp.push_back(c);
				else
					temp.push_back(t[i]);
			t = temp;
			ret++;
		}
		ans = min(ans, ret);
	}
	cout << ans << "\n";
	return 0;
}

Submission Info

Judge Result