Submission #1359814

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
#include <stack>
#include <cassert>
using namespace std;
typedef long long LL;
const int M = 1e6 + 5;
const int N = 200000 + 5;
const LL mod = 19260817;
const int MAX = 5e5 + 5;
const int MAXV = 100000 + 5;
const LL INF = (1LL << 62);
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.);
char s[105],now[105];
int len;
int c(char x){
    strcpy(now,s);
    for(int i = 0; i <= len; i++){
        bool flag = 1;
        for(int j = 0; j < len - i; j++)if(now[j] != x)flag = 0;
        if(flag)return i;
        for(int j = 0; j < len - i - 1; j++){
            if(now[j] == x || now[j + 1] == x){
                now[j] = x;
            }
        }
    }
}
int main() {
#ifdef local
    freopen("input", "r", stdin);
//    freopen("w", "w", stdout);
//    freopen("input", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    int ans = inf;
    cin>>s;
    len = strlen(s);
    for(int i = 0; i < 26; i++){
        ans = min(ans,c(i + 'a'));
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result