# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1199603 | 12345678 | Laugh Analysis (IOI16_laugh) | C++20 | 2 ms | 1352 KiB |
#include "laugh.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=1e5+5;
int dp[nx][2], ans;
int longest_laugh(std::string s)
{
int n=s.size();
s=' '+s;
for (int i=1; i<=n; i++)
{
dp[i][0]=dp[i][1]=i;
if (s[i]=='a') dp[i][0]=dp[i-1][1];
if (s[i]=='h') dp[i][1]=dp[i-1][0];
ans=max({ans, i-dp[i][0], i-dp[i][1]});
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |