Submission #1575788

---

Source Code Expand

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

#define INF (1LL << 31 - 1)
#define MOD int(1e9+7)
#define repi(i,j,n) for(int i = (j); i < (n); ++i)
#define rep(i,n) repi(i,0,n)
#define fi first
#define se second

inline void init() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}

bool check(string s) {
    int size_ = s.size();
    for (int i = 0; i < size_ - 1; ++i) {
        if (s[i] != s[i + 1]) return false;
    }
    return true;
}

string s;
int ans = (1LL << 31 - 1), si;
map<char, bool> mp;

int main() {
    cin >> s;

    si = s.size();
    for (int i = 0; i < si; ++i) mp[s[i]] = true;

    for (int i = 0; i < 26; ++i) {
        char c = 'a' + i;
        string t = s, u = "";
        int tmp = 0, n = si;
        if (!mp[c]) continue;

        while (!check(t)) {
            if (n < 0) break;
            tmp++;
            for (int j = 0; j < n - 1; ++j) {
                if (t[j] == c or t[j + 1] == c) {
                    u += c;
                }
                else {
                    u += t[j];
                }
            }
            t = u;
            u = "";
            n--;
        }
        ans = min(ans, tmp);
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result