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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template<class T> using ordered_set =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;

#define debug(x) cout << "[" <<  #x << " " << x << "] ";

#define ar array
#define ll long long
#define ld long double
#define sz(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()

typedef vector<int> vi;
typedef pair<int,int> pi;

const int MAX_N = 3e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;

int res[MAX_N];


void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    vi Lright(n+1,0);
    vi Rleft(n+1,0);
    for(int i=0 ;i<n; i++){
        Rleft[i+1] = Rleft[i] + (s[i] == 'P'); 
        Lright[n-i-1] = Lright[n-i] + (s[n-i-1] == 'L');
    }
    for(int i=0; i<n;i++){
        if(s[i] == 'P'){
            if(Lright[i] > Rleft[i])res[i] = 2*Rleft[i] + 1;
            else res[i] = 2*Lright[i];
        }
        else{
            if(Rleft[i] > Lright[i] -1 )res[i] = 2*(Lright[i]-1) + 1;
            else res[i] = 2*Rleft[i];
        }
    }
    for(int i=0; i<n; i++)cout << res[i] << " ";
}



int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int tc = 1;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t << ": ";
        solve();
    }
}