> > 欢迎加团
> > 网址：https://www.acgo.cn/application/2081002451237257216
> > 点个赞吧
#include <bits/stdc++.h>
#include <ctime>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> prefE(n + 1, 0), prefW(n + 1, 0);
for (int i = 0; i < n; i++) {
prefE[i + 1] = prefE[i] + (s[i] == 'E');
prefW[i + 1] = prefW[i] + (s[i] == 'W');
}
int totalE = prefE[n];
int ans = n;
for (int i = 1; i <= n; i++) {
int leftW = prefW[i - 1];
int rightE = totalE - prefE[i];
int turn = leftW + rightE;
ans = min(ans, turn);
}
cout << ans << endl;
return 0;
}
> > 做题解很辛苦的
> > 点个赞吧+关注求了
