Submission #1359368

---

Source Code Expand

/*#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp>*/
#include <bits/stdc++.h>

using namespace std;
//using namespace __gnu_pbds;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define FOR(i, a, b) for (int i=a; i<b; i++)
#define F0R(i, a) for (int i=0; i<a; i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
 
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

const int MOD = 1000000007;
double PI = 4*atan(1);

string s; 

int test(char x) {
    int ret = 0;
    while (1) {
        string s1;
        bool f = 1;
        F0R(i,s.length()) if (s[i] != x) {
            f = 0;
            break;
        }
        if (f == 1) return ret;
        
        ret ++;
        F0R(i,s.length()-1) {
            if (s[i] == x || s[i+1] == x) s1 += x;
            else s1 += 'A';
        }
        s = s1;
    }
}

int main() {
    cin >> s;
    int ans = MOD;
    F0R(i,26) {
        string t = s;
        ans = min(ans,test('a'+i));
        s = t;
    }
    cout << ans;
}

Submission Info

Judge Result