# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853811 | AndrijaM | Laugh Analysis (IOI16_laugh) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
const long long maxn=2e5+10;
const long long logn=23;
int n,q;
int main()
{
string s;
cin>>s;
n=s.size();
int ans=0;
for(int i=0;i<n;i++)
{
if(s[i]=='a' || s[i]=='h')
{
int j=i-1;
char k[2];
k[0]='a';
k[1]='h';
if(s[i]=='h')
{
swap(k[0],k[1]);
}
while(j+1<n && s[j+1]==k[0])
{
swap(k[0],k[1]);
j++;
}
ans=max(ans, j-i+1);
i=j;
}
}
cout<<ans<<endl;
return 0;
}
/*
7 1
1 1 1 1 1 1 1
1 3
1 2
3 7
2 4
2 5
2 6
2 2*/