Submission #3025007

---

Source Code Expand

#ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>

#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)

#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

using namespace std;


/*
ll pw(ll a, ll b) {
	ll ans = 1; while (b) {
		while (!(b & 1)) b >>= 1, a = (a * a) % MOD;
		ans = (ans * a) % MOD, --b;
	} return ans;
}
*/

const int MAXN = 310000;

int n;
string s;
int dp[MAXN];

int main() {
#ifdef FASTIO
	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#endif
	cin >> n >> s;
	int cur = 0;
	for (int i = 0; i < s.size(); ++i) {
		dp[i] += cur;
		if (s[i] == 'W')
			++cur;
	}
	cur = 0;
	for (int i = s.size() - 1; i >= 0; --i) {
		dp[i] += cur;
		if (s[i] == 'E')
			++cur;
	}
	int ans = s.size();
	for (int i = 0; i < n; ++i)
		ans = min(ans, dp[i]);
	cout << ans << "\n";
	return 0;
}

Submission Info

Judge Result