Submission #1774747

---

Source Code Expand

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>
#include<list>
#include<bitset>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000

using namespace std;

int main(void) {
	bool flag = false;
	int check = 0;
	int count = 0;
	int total = INF;
	string s;
	string p;
	string t;

	cin >> s;
	p = s;
	t = s;

	FOR(i, 0, 25) {
		count = 0;
		check = 0;
		flag = false;
		s = p;
		t = s;
		FOR(u, 0, s.size() - 2) {
			if (t[u] != 'a' + i) {
				break;
			}
			if (u == s.size() - 2) {
				total = 0;
				break;
			}
		}
		while (1) {
			FOR(u, 0, s.size() - 2) {
				if (s[u] == 'a' + i || s[u + 1] == 'a' + i) {
					check++;
					t[u] = 'a' + i;
				}

			}
			count++;
			if (check == 0) {
				break;
			}
			t.pop_back();
			FOR(u, 0, s.size() - 2) {
				if (t[u] != 'a' + i) {
					break;
				}
				if (u == s.size() - 2) {
					flag = true;
				}
			}
			s = t;

			if (flag == true) {
				if (count < total) {
					total = count;
				}
				break;
				s = p;
				t = s;
			}
		}

	}
	cout << total << endl;
	return 0;
}

Submission Info

Judge Result