题解 | 穷哈哈~

#include <iostream>
using namespace std;

int compare(int num, int max){
    if(num > max) max = num;
    return max;
}

int main() {
    int N;
    cin >> N;
    string s;
    cin >> s;
    
    int cur = 0;
    int ans = 0;
    
    for(int i = 0;i < s.size();i++){
        if(i == 0){
            if(s[i] == 'a' || s[i] == 'h'){
                cur = 1;
            }
        } else{
            if((s[i] == 'h' || s[i] == 'a') && (s[i] != s[i - 1])){
                cur++;
            } else if(s[i] == 'a' || s[i] == 'h'){
                cur = 1;
            } else{
                cur = 0;
            }
        }
        ans = max(ans, cur);

    }
    
    cout << ans;
    return 0;
    
}
// 64 位输出请用 printf("%lld")