cses day1 problems solutions

repetitions.cpp

#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

void solution(){
    string s;
    cin >> s;
    int count = 1;
    int max_count = 0;
    for(int i=0; i<s.length()-1; i++){
        if(s[i]==s[i+1]){
            count++;
        } else{
            max_count = max(max_count, count);
            count = 1;
        }
    }
    max_count = max(max_count, count);
    cout << max_count << endl;

}

int main() {
    int T=1;
    // cin >> T;
    for(int t=0; t<T; t++) {
        solution();
    }
    return 0;
}