Submission #1359991

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define mk make_pair
#define mod 1000000007
#define ff first
#define ss second

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

ll modpow(ll a, ll b){

    ll ans=1;
    while(b){
        if(b&1){
            ans=(ans*a)%mod;
        }
        a=(a*a)%mod;
        b=b/2;
    }
    return ans;
}

int cnt[26];

int main(){

	string s,ori;
    cin>>s;

    ori=s;

    int l = s.length();
    int dis = 0;
    for(int i=0;i<l;i++){
        if(cnt[s[i]-'a']==0) dis++;
        cnt[s[i]-'a']++;
    }

    if(dis==1){
        cout<<0<<endl;
        return 0;
    }

    int ans = 1000000;

    for(int i=0;i<26;i++){

        if(cnt[i]){
            int tmp = 0;
            s=ori;
            while(1){

                tmp++;

                string s1;
                int cnt2[26]={0};
                for(int j=0;j<s.size()-1;j++){
                    if((s[j]-'a')==i) s1+=s[j];
                    else if((s[j+1]-'a')==i) s1+=s[j+1];
                    else s1+=s[j];
                }
                s=s1;
                int dis = 0;
                for(int j=0;j<s.size();j++){
                    if(cnt2[s[j]-'a']==0) dis++;
                    cnt2[s[j]-'a']++;
                }

                if(dis==1) break;

            }

            ans=min(ans,tmp);

            


        }

    }

    cout<<ans<<endl;




}

Submission Info

Judge Result