Submission #2229248

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

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

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

    bool f=true;
    char tmp=s[0];
    rep(i, s.size()) {
        if (tmp != s[i]) f=false;
    }
    if (f) {
        cout << 0 << endl;
        return 0;
    }

    map<char, int> mp;
    rep(i, s.size()) mp[s[i]]++;
    int ret=1e8;
    string S = s;
    for (auto m : mp) {
        char ch = m.first;
        s = S;
        int ans=0;
        while (true) {
            string t = "";
            bool ok = true;
            rep(i, s.size()-1) {
                if (s[i] == ch or s[i+1] == ch) {
                    t += ch;
                }
                else {
                    t += s[i];
                }
            }
            ans++;
            rep (i, t.size()) {
                if (t[i] != ch) ok = false;
            }
            s = t;
            if (ok) break;
        }
        ret = min(ret, ans);
    }
    cout << ret << endl;
    return 0;
}

Submission Info

Judge Result