N. Max Subsequence – Codeforces Problem Solution in C++

Disclaimer: Make sure you tried enough before checking the solution

Problem: https://codeforces.com/group/MWSDmqGsZm/contest/219856/problem/N

#include <bits/stdc++.h>
using namespace std;
void solve(){
    int n;
    cin>>n;
    string s;
    cin>>s;
    int l = s.size();
    int c=1;
    for(int i=0;i<l-1;i++){
        if(s[i]!=s[i+1]) {
            c++;
        }
    }
    cout<<c<<endl;
}


int main(){

    int t=1;
    //cin >> t;
    while(t--)solve(); 
    return 0;
}

Assiut University Training – Newcomers Solution String