Submission #2239227

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);i++)
#define erep(i,a,b) for(int i=a;i<=(int)(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>(a);i--)
#define eper(i,a,b) for(int i=((int)(a));i>=b;i--)
#define pb push_back
#define mp make_pair
#define INF (1<<30)-1
#define MOD 1000000007
using namespace std;
typedef long long ll;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a/gcd(a, b)*b;}

string s;
int ans = INF;
int main() {
 ios::sync_with_stdio ( false );
 cin.tie ( 0 );
    cin >> s;
    int n = s.size();
    for (char c = 'a'; c <= 'z'; c++) {
        int mx = 0, cnt = 0;
        rep(i, 0, n) {
            if (s[i] != c) cnt++;
            else cnt = 0;
            mx = max(mx, cnt);
        }
        ans = min(ans, mx);
    }
    printf("%d\n",ans);
    return 0;
}

Submission Info

Judge Result