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

int main() {
    int n; cin >> n;

    vector<double> pos(n); 
    vector<char> dir(n); 
    vector<int> col(n, 0); 

    for (int i = 0; i < n; ++i) {
        pos[i] = i + 1;
    }
    for (int i = 0; i < n; ++i) {
        cin >> dir[i];
    }

    bool zachCol = true;
    while (zachCol) {
        zachCol = false;
        for (int i = 0; i < n; ++i) {
            if (dir[i] == 'L') {
                pos[i] -= 0.5;
            } else {
                pos[i] += 0.5;
            }
        }
        for (int i = 0; i < n; ++i) {
            for (int j = i + 1; j < n; ++j) {
                if (pos[i] == pos[j]) {
                    zachCol = true;
                    col[i]++;
                    col[j]++;
                    dir[i] = (dir[i] == 'L') ? 'P' : 'L';
                    dir[j] = (dir[j] == 'L') ? 'P' : 'L';
                }
            }
        }
    }
    
    for (int i = 0; i < n; ++i) {
        cout <<col[i] << " ";
    }
    return 0;
}