# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
939393 | KK_1729 | Laugh Analysis (IOI16_laugh) | C++17 | 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 "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(i,0,n){
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;
}