Codeforces Round #505 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)-C. Plasticine zebra

#include<iostream>
#include<string.h>
#include<stdio.h>
#include<algorithm>
#include<map>
using namespace std;
int main(){
   string a;
   while(cin>>a){
    int len1=a.length();
    a=a+a;
    int len=a.length();
      int sum=1;
      int ans=1;
      for(int i=0;i<len-1;i++){
        if (a[i]!=a[i+1]){
            sum++;
            ans=max(ans,sum);
        }else {
            sum=1;
        }
      }
      ans=min(len1,ans);
      cout<<ans<<endl;
   }
   return 0;
}