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
#include <cstdio>

const int MAX = 3*1e5;

char s[MAX+1];
int  o[MAX];
int main() 
{
   
    int n;
    scanf("%d", &n);
    scanf("%s", &s);

    int p = 0;

    for(int i = 0; i < n; i++) {
        if(s[i]=='P') p++;
    }
    int j = 0;
    for(int i = 0; i < n-p; i++) {

        if(s[i]=='P') {
            o[i] = j*2 + 1;
            j++;
        }
        else o[i] = j*2;
    }

    j = 0;
    for(int i = n-1; i >= n-p; i--) {

        if(s[i]=='L') {
            o[i] = j*2 + 1;
            j++;
        }
        else o[i] = j*2;
    }
    int i = 0;
    for(; i < n-1; i++) {
        printf("%d ", o[i]);
    }
    printf("%d\n", o[i]);
    return 0;
}