Submission #939395

#TimeUsernameProblemLanguageResultExecution timeMemory
939395KK_1729Laugh 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(); vector<int> dp(n); if (s[0] == 'h' || s[0] == 'a') dp[0] = 1; for (int i = 0; i < n; ++i){ if (s[i] == 'h'){ if (s[i-1] == 'a') dp[i] = dp[i-1]+1; } if (s[i] == 'a'){ if (s[i-1] == 'h') dp[i] = dp[i-1]+1; } } int ans = 0; for (auto x: dp) ans = max(ans, x); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...