Submission #2712491

---

Source Code Expand

N = int(input())
S = input()
if len(S) != N: raise

lcost = [0] * N  # lcost[i]はS[:i]中の'W'の個数
rcost = [0] * N  # rcost[i]はS[i+1:]中の'E'の個数
for i in range(N - 1):
    lcost[i + 1] = lcost[i] + (1 if S[i] == 'W' else 0)
for i in range(N - 1, 0, -1):
    rcost[i - 1] = rcost[i] + (1 if S[i] == 'E' else 0)

print(min(p[0] + p[1] for p in zip(lcost, rcost)))

Submission Info

Judge Result