Submission #3402900

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
const ll LLINF = LLONG_MAX/3;

int main(){
	int N;
	cin >> N;
	vector<int> dir(N);
	string S;
	cin >> S;
	REP(i, N) dir[i] = (S[i]=='W');
	vector<int> dir_sum(N+1);
	dir_sum[0] = 0;
	REP(i, N) dir_sum[i+1] = dir_sum[i] + dir[i];
	ll res = LLINF;
	REP(i, N){
		ll left_west = dir_sum[i] - dir_sum[0];
		ll right_west = dir_sum[N] - dir_sum[i+1];
		res = min(res, left_west + (N-i-1-right_west));
	}
	cout << res << endl;
    return 0;
}

Submission Info

Judge Result