20082번 - Laugh 서브태스크다국어언어 제한함수 구현

문제

Russian scientists are working on several promising topics. One of them is the quality of laugh. In this research they analyse the human speech and extract the laugh from it.

The scientists already made the software which converts speech to text. They consider a string of alternating letters “h” and “a” to be a laugh. For example, strings “ahahaha”, “hah” and “a” are laughs, but “abacaba” and “hh” are not.

You are given a string s containing the text. Find the length of the longest substring which is considered a laugh.

구현

You should implement the following function (method):

• int longest_laugh(string s). This function should return the length of the longest substring of s which is considered a laugh.

Please use the provided template files for details of implementation in your programming language.

입력

출력

제한

예제 1

• s = “ahaha”

The whole string is a laugh, so the answer is 5.

예제 2

• s = “ahahrunawayahahsofasthah”

The longest substring is “ahah”, so the answer is 4.

예제 3

• s = “ahahaahaha”

The longest substring is “ahaha”, so the answer is 5.

서브태스크

힌트

샘플 그레이더

The sample grader reads the input in the following format:

• line 1: string s.

첨부

• laugh.h
• laugh.cpp
• grader.cpp
• 01.in
• 01.out
• 02.in
• 02.out
• 03.in
• 03.out