Submission #1898636

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const long long INF = 123456789;
const long long MOD = 1000000007;
const long double PI = 3.1415926;
#define FOR(i, r, n) for (ll i = (ll)(r); i < (ll)(n); i++)
#define RFOR(i, r, n) for (ll i = (ll)(n - 1); i >= r; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<pair<ll, ll>> vp;
typedef vector<string> vs;
typedef vector<char> vc;
typedef list<ll> lst;

ll n, m, k, ans = 0, sum = 0, cnt = 0;
string s;
char c;

#define Endl endl

/*--------------------template--------------------*/

int main()
{
    cin >> s;
    vi v;
    cnt = 1;
    REP(i, s.size() - 1)
    {
        if (s[i] == s[i + 1])
        {
            cnt++;
        }
        else
        {
            v.push_back(cnt);
            cnt = 1;
        }
    }
    v.push_back(cnt);
    if (v.size() == 2)
    {
        sort(ALL(v));
        cout << v.back() << endl;
        return 0;
    }
    else
    {
        while (1)
        {
            ll i = 0;
            vi vt(v.size() - 2);
            ll a = v[i];
            ll b = v[i + 1];
            ll c = v[i + 2];
            ll d = max({a, b, c});
            vt[0] = d;
            REP(j, v.size() - 2)
            {
                vt[j + 1] = v[j + 3];
            }
            v.clear();
            REP(j, vt.size())
            {
                v.push_back(vt[i]);
            }
            vt.clear();
            if (v.size() <= 3)
            {
                sort(ALL(v));
                cout << v.back() << endl;
                return 0;
            }
        }
    }
}

Submission Info

Judge Result