Submission #2711172

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pw(x) (1ll << (x))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define rep(i,l,r) for(int i=(l);i<(r);++i)
#define per(i,l,r) for(int i=(r)-1;i>=(l);--i)
#define dd(x) cout << #x << " = " << (x) << ", "
#define de(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"

//-----
const int N = 3e5 + 7;
int pre[N], suf[N];
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	int n; string s;
	cin >> n >> s;
	rep(i, 0, sz(s)) pre[i + 1] = (s[i] == 'W') + pre[i];
	per(i, 0, sz(s)) suf[i + 1] = (s[i] == 'E') + suf[i + 2];
	int ans = INT_MAX;
	rep(i, 1, sz(s) + 1) ans = min(ans, pre[i - 1] + suf[i + 1]);
	cout << ans;
	return 0;
}

Submission Info

Judge Result