扫一遍,记录x的个数,如果遇到不是x的字符判断已有x的个数即可。
#include <iostream>
#include <string>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#define MAX 1005
#define mod 998244353ll
#define INF 0x3f3f3f3f
#define ll long long
using namespace std;
int main() {
freopen("a.txt", "r", stdin);
freopen("b.txt", "w", stdout);
int n;
string s;
cin >> n >> s;
int c = 0, ans = 0;
for (int i = 0; s[i]; ++i) {
if (s[i] == 'x')c++;
else {
if (c >= 3) {
ans = ans + c - 2;
}
c = 0;
}
}
if (c >= 3)ans = ans + c - 2;
cout << ans << endl;
return 0;
}