Submission #1899957

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
//________
#define pb push_back
#define fi first
#define se second
#define mkp make_pair
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0; i<(n); ++i)
#define reps(i,f,n) for(int i=(f); i<=(n); ++i)
#define show(x) cerr << #x << ':' << (x) << endl
#define outl(x) cout << (x) << '\n'
#define FAST() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef pair<int,int> Pii;
template<class A, class B>inline bool chmax(A &a, B b){return b>a ? a=b,1 : 0;}
template<class A, class B>inline bool chmin(A &a, B b){return b<a ? a=b,1 : 0;}
inline bool inside(int y, int x, int H, int W){return(y>=0 && x>=0 && y<H && x<W);}
inline int updiv(int a, int b){return((a+b-1) / b);}
const int INF = 1 << 29;
const int dx[] = {1, 0, -1, 0,  1, 1, -1, -1};
const int dy[] = {0, 1, 0, -1,  -1, 1, 1, -1};
#define Size 1000011
#define NIL -1
//________


signed main()
{
    FAST();
    string s;
    cin >> s;
    int maxv = min(s.length(), 2UL);
    int cnt = 1;

    for(int i=1; i<s.length(); ++i){
        if(s[i-1] == s[i]){
            ++cnt;
        }
        else {
            cnt = 1;
        }
        chmax(maxv, cnt);
    }
    outl(maxv);
}

Submission Info

Judge Result