dsa-competitive-programming/cses/1069.cpp

//URL - https://cses.fi/problemset/task/1069 
//CSES
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#define dbg(x) cerr << #x << " = " << x << endl
#else
#define dbg(x)
#endif

#define ll long long
#define ld long double
#define ar array
#define all(x) (x).begin(), (x).end()
#define sza(x) (int)(x).size()

const ll INF = 1e18;
const int MOD = 1e9 + 7;

void solve() {
        string s;
        cin>>s;
        int cur = 1, best = 1;

        for(int i =1;i<s.size();i++){
            
            if(s[i]==s[i-1]) cur++;
            else cur =1;
            best = max(best,cur);
            
        }
        cout<<best;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int tc = 1;
    // cin >> tc;
    while(tc--) solve();
}