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
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    string ants;
    cin >> n >> ants;

    vector<int> CP(n), CS(n);
    for (int i = 1; i<n; i++) {
        CP[i] = CP[i-1];
        if (ants[i-1] == 'P')
            CP[i]++;
    }
    for (int i = n-2; i>=0; i--) {
        CS[i] = CS[i+1];
        if (ants[i+1] == 'L')
            CS[i]++;
    }

    vector<int>R(n);
    for (int i = 0; i<n; i++)
        if (ants[i] == 'L')
            R[i] = min(2*CP[i], 2*CS[i]+1);
        else
            R[i] = min(2*CS[i], 2*CP[i]+1);

    for (int i = 0; i < n; i++)
        cout << R[i] << ' ';
    cout << '\n';

    return 0;
}