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
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<", "<<get<3>(t)<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);

    constexpr char left = 'L';
    constexpr char right = 'P';

    int n;
    cin >> n;

    vector<char> v(n);
    REP(i, n)
        cin >> v[i];
    debug(n, v);

    vector<int> pref_left(n);
    REP(i, n) {
        pref_left[i] = v[i] == left;
        if (i)
            pref_left[i] += pref_left[i - 1];
    }
    debug(pref_left);

    auto cnt_left = [&](int l, int r) {
        if (l > r) return 0;
        return pref_left[r] - (l ? pref_left[l - 1] : 0);
    };
    auto cnt_right = [&](int l, int r) {
        if (l > r) return 0;
        return (r - l + 1) - cnt_left(l, r);
    };

    vector<int> ans(n);

    REP(i, n) {
        const int l = cnt_right(0, i - 1);
        const int r = cnt_left(i + 1, n - 1);
        const int val = v[i] == left ?
            min(l, r + 1) + min(r, l) :
            min(r, l + 1) + min(l, r) ;
        debug(i, v[i], l, r, val);
        ans[i] = val;
    }

    REP(i, n)
        cout << ans[i] << (i == n - 1 ? '\n' : ' ');
}