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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
// Karol Kosinski 2024
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define X first
#define Y second
#define endl '\n'
#define NAM(x) #x,'=',x
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;
template<class...T> void _cout(T...a){(cout<<...<<a);}

#ifndef ENABLE_DEBUG
#define DEB(k,p,f,x...)
#else
#define DEB(k,p,f,x...) {if(k)_cout("------",setw(4),__LINE__," : ",__FUNCTION__,endl);if(p)f(x);}
#endif
#define DEBF(f,x...)    DEB(1,1,f,x)
#define DEBL            DEBF(void,0)
#define DEBC(p,x...)    DEB(0,p,_cout,x)
#define DEBUG(x...)     DEBC(1,x)

constexpr int NX = 300'005;

struct FenwickTree
{
    LL A[NX];

    void add(int x, LL v) { for ( ; x < NX; x |= x + 1 ) A[x] += v; }

    LL pref_sum(int x)
    {
        LL s = 0;
        for ( ++ x; x > 0; x &= x + 1 ) s += A[ -- x ];
        return s;
    }
};

struct FenwickSegmentTree
{
    FenwickTree M {}, B {};

    void add(int b, int e, LL v)
    {
        M.add( b, v ), M.add( e, -v );
        B.add( b, v * (1 - b) );
        B.add( e, v * e );
    }

    LL pref_sum(int x) { return M.pref_sum(x) * x + B.pref_sum(x); }
};

FenwickSegmentTree FST {};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, counter = 0;
    string str;
    cin >> n >> str;
    FOR(i,0,n)
    {
        if (str[i] == 'P') ++ counter;
        else if (counter)
        {
            FST.add(i - counter, i - 1, 1);
            FST.add(i - counter + 1, i, 1);
        }
    }
    FOR(i,0,n) cout << FST.pref_sum(i) - FST.pref_sum( i - 1 ) << ' ';
    cout << endl;
    return 0;
}