题解 | 穷哈哈~

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n;
	char str[100086] = {0};
	cin >> n >> str;
	int ans = 0;
	int max_cnt = 0;
	int connection = 0;
	int check = 1;
	for (int i = 0; i < n - 1; i++) {
		if (check) {
			if (str[i] == 'a' || str[i] == 'h') {
				ans = 1;
				check = 0;
				connection = 1;
			}
		}
        max_cnt = max(max_cnt, ans);
		if (str[i] == 'a' && str[i + 1] == 'h' && connection == 1) {
			ans++;
		} else if (str[i] == 'h' && str[i + 1] == 'a' && connection == 1) {
			ans++;
		} else {
			connection = 0;
            ans=0;
		}
		if (str[i] == 'a' && str[i + 1] == 'h' && connection == 0) {
			connection = 1;
            ans=2;
		} else if (str[i] == 'h' && str[i + 1] == 'a' && connection == 0) {
			connection = 1;
            ans=2;
		}
		max_cnt = max(max_cnt, ans);
	}
	cout << max_cnt;
	return 0;
}