Submission #1989035

---

Source Code Expand

#include "bits/stdc++.h"

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define pb push_back

using namespace std;

using ll = long long;
using P = pair<int,int>;

const int mod=1e9+7,INF=1<<30;
const double EPS=1e-12,PI=3.1415926535897932384626;
const ll LINF=1LL<<60, lmod = 1e9+7;

const int MAX_N = 202;

int main(){
  string s; cin >> s;
  int N = s.size();
  int ans = INF;
  for(char c='a';c<='z';c++){
    string a = s;
    int sz = N;
    while(true){
      bool same=true;
      rep(i,sz) same &= (a[i]==c);
      if(same) break;
      else sz--;
      rep(i,sz){
        if(a[i]==c || a[i+1]==c){
          a[i] = c;
        }else{
          a[i] = c-1;
        }
      }
      // cout << sz << ","<< a << endl;
    }
    // cout << sz << endl;
    ans = min(ans,N-sz);
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result