Submission #1359984

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

string S;
bool single(string s, int c) {
  rep(i, s.length()) {
    if (s[i] != c) return false;
  }
  return true;
}

int solve(int c) {
  string s(S);
  int ctr = 0;
  while (!single(s, c)) {
    string t = "";
    rep(i, (int)s.length()-1) {
      if (s[i] == c || s[i+1] == c) t += c;
      else t += 30;
    }
    ctr++;
    s = t;
  }
  return ctr;
}
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> S;
  rep(i, S.length()) S[i] -= 'a';
  int m = INF;
  rep(c, 26) {
    m = min(m, solve(c));
  }
  cout << m << "\n";
  return 0;
}

Submission Info

Judge Result