Submission #3053469

---

Source Code Expand

#include <bits/stdc++.h>
#include <numeric>
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
#define LL long long
#define Dev 1000000007

// sort(a.begin(), a.end(), std::greater<int>());
using namespace std;

int main()
{
    int n;
    cin >> n;
    string s;
    cin >> s;
    int posi = 0;
    int minNum = 0;
    vector<int> elist(s.size(), 0);
    vector<int> wlist(s.size(), 0);
    if (s[0] == 'E')
        elist[0] = 1;
    if (s[0] == 'W')
        wlist[0] = 1;
    REP(i, 1, s.size())
    {
        if (s[i] == 'E')
        {
            elist[i] = elist[i - 1] + 1;
            wlist[i] = wlist[i - 1];
        }
        if (s[i] == 'W')
        {
            elist[i] = elist[i - 1];
            wlist[i] = wlist[i - 1] + 1;
        }
    }
    int num = INT_MAX;
    num = min(num, (elist.back()));
    REP(i, 1, elist.size())
    {
        num = min(num, (elist.back() - elist[i] + wlist[i]));
    }
    cout << num << endl;
    return 0;
}

Submission Info

Judge Result