Problem:
Score : 300 points

Problem Statement

There are N people standing in a row from west to east.
Each person is facing east or west.
The directions of the people is given as a string S of length N.
The i-th person from the west is facing east if S_i = E, and west if S_i = W.

You will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader.
Here, we do not care which direction the leader is facing.

The people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized.
Find the minimum number of people who have to change their directions.

Constraints

2 \leq N \leq 3 \times 10^5

|S| = N

S_i is E or W.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the minimum number of people who have to change their directions.

Sample Input 1

5
WEEWW

Sample Output 1

1

Assume that we appoint the third person from the west as the leader.
Then, the first person from the west needs to face east and has to turn around.
The other people do not need to change their directions, so the number of people who have to change their directions is 1 in this case.
It is not possible to have 0 people who have to change their directions, so the answer is 1.

Sample Input 2

12
WEWEWEEEWWWE

Sample Output 2

4

Sample Input 3

8
WWWWWEEE

Sample Output 3

3

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io::prelude::*;

fn input<T>() -> T
where
    T: std::str::FromStr,
{
    let stdin = std::io::stdin();
    let token = stdin
        .lock()
        .bytes()
        .map(|c| c.unwrap() as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect::<String>();
    token.parse().ok().unwrap()
}

fn main() {
    let n = input::<usize>();
    let s = input::<String>().chars().collect::<Vec<char>>();

    let mut sum_w = vec![0; n + 1];
    let mut sum_e = vec![0; n + 1];
    for i in 0..n {
        sum_w[i + 1] = sum_w[i];
        if s[i] == 'W' {
            sum_w[i + 1] += 1;
        }
        sum_e[n - i - 1] = sum_e[n - i];
        if s[n - i - 1] == 'E' {
            sum_e[n - i - 1] += 1;
        }
    }

    let mut ans = std::cmp::min(sum_e[1], sum_w[n - 1]);
    for i in 1..n - 1 {
        ans = std::cmp::min(ans, sum_e[i + 1] + sum_w[i - 1]);
    }
    println!("{}", ans);
}