Submission #1359354

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <ctime>
#include <string>
#include <cstring>
#include <complex>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
#define mp make_pair


int main()
{
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    string s;
    cin >> s;
    int n = (int)s.length();
    int ans = n;
    for (char c : s) {
        int res = 0;
        int l = 0;
        while(l < n) {
            if (s[l] == c) {
                l++;
                continue;
            }
            int r = l;
            while(r < n && s[r] != c) r++;
            res = max(res, r - l);
            l = r;
        }
        ans = min(ans, res);
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result