Submission #2711678

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
const int MAXN = 3e5 + 5;
int n, result = MAXN;
string s;
int west[MAXN], east[MAXN];

int westsum(int x, int y) {
	return west[y] - west[x - 1];
}

int eastsum(int x, int y) {
	return east[y] - east[x - 1];
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n >> s;
	if (n == 1) {
		cout << 1 << "\n";
		return 0;
	}
	s = '#' + s;
	west[0] = east[0] = 0;
	for (int i = 1; i <= n; i++) {
		west[i] = west[i - 1] + (s[i] == 'W');
		east[i] = east[i - 1] + (s[i] == 'E');
	}

	result = min(result, eastsum(2, n));
	result = min(result, westsum(1, n - 1));
	for (int i = 2; i < n; i++)
		result = min(result, westsum(1, i - 1) + eastsum(i + 1, n));

	cout << result << "\n";
	return 0;
}

Submission Info

Judge Result