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
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 300005;

int n, leftIdx, rightIdx;
string text;
int swaps[MAX_N];

int main()
{
    ios::sync_with_stdio(0);

    cin >> n;
    cin >> text;

    rightIdx = n-1;

    while(true)
    {
        while(text[leftIdx] == 'L' && leftIdx < n)
        {
            ++leftIdx;
        }
        while(text[rightIdx] == 'P' && rightIdx >= 0)
        {
            --rightIdx;
        }

        if(leftIdx > rightIdx || leftIdx >= n || rightIdx < 0)
        {
            break;
        }

        for(int i = leftIdx+1; i <= rightIdx; ++i)
        {
            if(text[i-1] == 'P' && text[i] == 'L')
            {
                ++swaps[i-1];
                ++swaps[i];

                text[i-1] = 'L';
                text[i] = 'P';

                ++i;
            }
        }
    }

    for(int i = 0; i < n; ++i)
    {
        cout << swaps[i] << ' ';
    }
    cout << endl;

    return 0;
}