| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1304155 | nathlol2 | Laugh Analysis (IOI16_laugh) | C++20 | 3 ms | 840 KiB |
#include "laugh.h"
#include <bits/stdc++.h>
int longest_laugh(std::string s){
int n = s.size();
int dp[n + 1];
memset(dp, 0, sizeof dp);
for(int i = 1;i<=n;i++){
if(s[i - 1] == 'a'){
if(i >= 2 && s[i - 2] == 'h'){
dp[i] = dp[i - 1] + 1;
}else{
dp[i] = 1;
}
}else if(s[i - 1] == 'h'){
if(i >= 2 && s[i - 2] == 'a'){
dp[i] = dp[i - 1] + 1;
}else{
dp[i] = 1;
}
}
}
return *std::max_element(dp, dp + n + 1);
}
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... | ||||
