Submission #1359367

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define itrep(i, a) for (auto i = (a).begin(); i != (a).end(); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

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

template<class T> void inputVector(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}

bool check(string &s, char ch) {
	rep(i, s.size()) {
		if (s[i] != ch) return false;
	}
	return true;
}

signed main() {
	string s;
	cin >> s;

	int ret = INT_MAX;
	rep(i, s.size()) {
		char ch = s[i];

		string t = s;
		int cnt = 0;
		while (!check(t, ch)) {
			string tt = "";
			rep(i, t.size() - 1) {
				if (t[i] == ch || t[i + 1] == ch) {
					tt += ch;
				} else {
					tt += t[i];
				}
			}
			t = tt;
			cnt++;
		}
		ret = min(ret, cnt);
	}

	cout << ret << endl;

    return 0;
}

Submission Info

Judge Result