1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <bits/stdc++.h>
#define FOR(i, a, b) for(int i =(a); i < (b); ++i)
#define re(i, n) FOR(i, 1, n)
#define ford(i, a, b) for(int i = (a); i >= (b); --i)
#define rep(i, n) for(int i = 0;i <(n); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<pll> vpll;
typedef vector<pii> vpii;

const ll inf = 1e18;
const int N = 5005;
const int mod = 1e9 + 7;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    queue<pii> dupa;
    vi ans(n);
    int cnt = 0;
    rep(i, n)
    {
        char c;
        cin >> c;
        if (c == 'L')
        {
            if (dupa.empty())
            {
                ans[i] =0;
            }
            else
            {
                pii v = dupa.front();
                dupa.pop();
                ans[v.first] = cnt - v.second + 1;
                dupa.push({i, cnt+1});
                cnt += 2;
            }
        }
        else
        {
            dupa.push({i, cnt});
        }
    }
    while (!dupa.empty())
    {
        pii v = dupa.front();
        dupa.pop();
        ans[v.first] = cnt - v.second;
    }
    rep(i, n) cout << ans[i] << ' ';
    cout << '\n';
}