Submission #1359972

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9+7;
int solve(string s, char c){
    int n = s.size();
    bitset<100> bs;
    for(int i = 0; i < n; ++i)
        if(s[i] == c)
            bs.set(i);
    if(bs.count() >= n)
        return 0;
    //cout << c << ' ' << bs << '\n';
    for(int times = 1; times <= n; ++times){
        bs = bs | (bs>>1);
        //cout << bs << '\n';
        bool ok = true;
        for(int i = 0; i < n-times; ++i)
            if(bs[i] != 1)
                ok = false;
        if(ok)
            return times;
    }
    return n;
}
int main(){
    string s;
    cin >> s;
    int n = s.size();
    int ans = n;
    //solve(s,'r');
    //return 0;
    for(char c = 'a'; c <= 'z'; ++c){
        ans = min(ans,solve(s,c));
        //cout << c << ' ' << ans << '\n';
    }
    cout << ans << '\n';
}

Submission Info

Judge Result