Submission #1360066

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#define int long long
using namespace std;

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

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

    int count[26];
    for (int i = 0; i < 26; i++) {
        count[i] = 0;
    }

    for (int i = 0; i < s.size(); i++) {
        count[s[i] - 'a']++;
    }

    int maxcount = count[0];
    for (int i = 1; i < 26; i++) {
        maxcount = max(maxcount, count[i]);
    }

    int ans = 1000;
    for (int i = 0; i < 26; i++) {
//        if (count[i] < maxcount) continue;
        string temp = s;
        int res = 0;
        while (!check(temp)) {
            for (int j = 0; j < temp.size() - 1; j++) {
                if (temp[j + 1] == i + 'a') temp[j] = temp[j + 1];
            }
            temp.erase(temp.begin() + temp.size() - 1);
            res++;
//            cout << temp << endl;
        }
        ans = min(ans, res);
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result