Submission #1793280

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

template <typename T> T inf;
template <> constexpr int inf<int> = 1e9;
template <> constexpr ll inf<ll> = 1e18;

int main() {
    string s;
    cin >> s;
    int res = inf<int>;
    for(int i = 0; i < 26; ++i) {
        char c = 'a' + i;
        if(s.find(c) == string::npos) {
            continue;
        }

        string t = s;
        int cnt = 0;
        while(true) {
            {
                bool ok = true;
                for(auto cc : t) {
                    ok &= cc == c;
                }
                if(ok) {
                    break;
                }
            }
            
            cnt++;
            string nxt;
            for(int j = 0; j + 1 < t.size(); ++j) {
                if(t[j] == c || t[j + 1] == c) {
                    nxt += c;
                } else {
                    nxt += t[j];
                }
            }
            t = move(nxt);
        }
        res = min(res, cnt);
    }
    cout << res << endl;
}

Submission Info

Judge Result