Submission #853813

#TimeUsernameProblemLanguageResultExecution timeMemory
853813AndrijaMLaugh Analysis (IOI16_laugh)C++14
0 / 100
0 ms344 KiB
#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 longest_laugh(std::string 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*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...