Submission #1031994

#TimeUsernameProblemLanguageResultExecution timeMemory
10319947againLaugh Analysis (IOI16_laugh)C++17
0 / 100
0 ms348 KiB
#include "laugh.h" #include <bits/stdc++.h> using namespace std ; int longest_laugh(string s) { int n = s.size() ; int ok = 0 ; int ans[n]{0} ; int mx = 0 ; for(int i = 0 ; i < n ; i++) { if(ok == 0 && s[i] == 'h') { ans[i] = ans[i - 1] + 1 ; ok = 1 ; } else if(ok == 1 && s[i] == 'a') { ans[i] = ans[i - 1] + 1 ; ok = 0 ; } else { ans[i] = 0 ; ok = 0 ; } mx = max(mx , ans[i]) ; } fill(ans , ans + n , 0) ; ok = 1 ; for(int i = 0 ; i < n ; i++) { if(ok == 1 && s[i] == 'h') { ans[i] = ans[i - 1] + 1 ; ok = 0 ; } else if(ok == 0 && s[i] == 'a') { ans[i] = ans[i - 1] + 1 ; ok = 1 ; } else { ans[i] = 0 ; ok = 0 ; } mx = max(mx , ans[i]) ; } if(mx == 1) return 0 ; return mx ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...