Submission #898360

#TimeUsernameProblemLanguageResultExecution timeMemory
898360devkudawlaLaugh Analysis (IOI16_laugh)C++17
100 / 100
3 ms1268 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll  int
int longest_laugh(string s){
 
        ll n = s.size();
        vector<ll> dp(n, 0);
        if (s[0] == 'h' or s[0] == 'a')
            dp[0] = 1;
        ll answer = 0;
        for (ll i = 1; i < n; i++)
        {
            if (s[i] == 'h' or s[i] == 'a')
            {
                dp[i] = 1;
                if ((s[i] == 'h' and s[i - 1] == 'a') or (s[i] == 'a' and s[i - 1] == 'h'))
                    dp[i] = max(dp[i], dp[i - 1] + dp[i]);
            }
            answer = max(answer, dp[i]);
        }
 
      return answer;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...