oj.uz

Submission #853813

# Submission time Handle Problem Language Result Execution time Memory
853813 2023-09-25T09:26:33 Z AndrijaM Laugh Analysis (IOI16_laugh) C++14
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

const long long mod=1e9+7;
const long long maxn=2e5+10;
const long long logn=23;

int n,q;

int longest_laugh(std::string s)
{
    n=s.size();
    int ans=0;
    for(int i=0;i<n;i++)
    {
        if(s[i]=='a' || s[i]=='h')
        {
            int j=i-1;
            char k[2];
            k[0]='a';
            k[1]='h';
            if(s[i]=='h')
            {
                swap(k[0],k[1]);
            }
            while(j+1<n && s[j+1]==k[0])
            {
                swap(k[0],k[1]);
                j++;
            }
            ans=max(ans, j-i+1);
            i=j;
        }
    }
    cout<<ans<<endl;
    return 0;
}
/*
7 1
1 1 1 1 1 1 1
1 3
1 2
3 7
2 4
2 5
2 6
2 2*/

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #2
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Extra information in the output file
2 Halted 0 ms 0 KB -