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
#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D("[Debug] "#__VA_ARGS__ " = "), \
              debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 300010;

int n, L[maxn], R[maxn];
string s;

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> s, s = "#" + s;
  rep (i, 1, n) {
    L[i] = L[i - 1], R[i] = R[i - 1];
    if (s[i] == 'L') L[i]++;
    else R[i]++;
  }
  rep (i, 1, n) {
    int pr = R[i - 1], sl = L[n] - L[i];
    if (s[i] == 'P') {
      if (pr == sl) cout << pr + sl << ' ';
      else if (pr < sl) cout << 2 * pr + 1 << ' ';
      else cout << 2 * sl << ' ';
    } else {
      if (pr == sl) cout << pr + sl << ' ';
      else if (sl < pr) cout << 2 * sl + 1 << ' ';
      else cout << 2 * pr << ' ';
    }
  }
  cout << '\n';
}