Submission #1791842

---

Source Code Expand

#include <bits/stdc++.h>

#define int long long

using namespace std;

int u[3001][101];
int ok[101];

int get (string a, char po) {
	memset (u, 0, sizeof u);
	memset (ok, 0, sizeof ok);
	int mn = 0;
	for (int i = 0;i < a.size ();i ++) {
		if (a[i] == po) mn ++;
	}
	if (mn == a.size ()) return 0;
	string ne = "";
	bool ko = 0;
	for (int i = 0;i < a.size ();i ++) {
		if (a[i] == po) {
			ok[i - 1] = 1;
			ok[i] = 1;
		}	
	}
	for (int i = 0;i < a.size () - 1;i ++) {
		if (ok[i] == 1) {
			ne += po;
		}
		else {
			ne += a[i];
		}
	}
	return get (ne, po) + 1;
}

 main () {
	ios_base::sync_with_stdio (0);
	cin.tie (0);
	string a;
	cin  >> a;
	int anq = 1e9 + 7;
	for (char f = 'a';f <= 'z';f ++) {
		anq = min (anq, get (a, f));
	}
	cout << anq;
	return 0;
}

Submission Info

Judge Result