Submission #1359974

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
#define int long long
#define rep(i,a,n) for (int (i)=(a);(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef long double ld;
signed  main() {
	string s;
	cin >> s;
	int n = s.size(), ans = 10000000000;
	for (int z = 0; z < 26; z++) {
		char a = (char)z + 'a';
		int sum = 0;
		int d[26];
		fill(d, d + 26, 0);
		string h = s;
		for (int i = 0; i < n; i++)
			d[(int)s[i] - 'a']++;
		for (int i = 0; i < 26; i++) {
			if (d[i] != 0)
				sum++;
		}
		if (sum == 1)
			ans = 0;
		for (int i = n - 1; i >= 0; i--) {
			for (int j = 0; j < i; j++) {
				if (h[j] == a)
					continue;
				if (h[j + 1] == a) {
					d[(int)h[j] - 'a']--;
					if (d[(int)h[j] - 'a'] == 0)
						sum--;
					h[j] = a;
				}
			}
			d[(int)h[i] - 'a']--;
			if (d[(int)h[i] - 'a'] == 0)
				sum--;
			if (sum == 1) {
				ans = min(n - i, ans);
				break;
			}
		}
	}
	cout << ans << endl;
	getchar(); getchar();
}

Submission Info

Judge Result