#include <bits/stdc++.h> #define fi first #define sc second #define pb push_back #define rep(i,p,k) for(int i=(p);i<(k);++i) #define forn(i,p,k) for(int i=(p);i<=(k);++i) #define forr(i,k,p) for(int i=(k)-1;i>=(p);--i) #define each(a,b) for(auto&a:b) #define all(v) begin(v), end(v) #define RET(smth) return void(cout<<(smth)<<'\n'); #define sz(v) (int)v.size() using namespace std; using pii = pair<int,int>; using ll = long long; using Vi = vector<int>; #ifdef DEBUG #include "debug.h" #else #define debug(...) ; #endif int main() { #ifndef DEBUG cin.tie(0) -> sync_with_stdio(0); #endif int n; cin >> n; string S; cin >> S; int cnt = 0; Vi res(n + 1); rep(i,0,n) { if(S[i] == 'P') cnt++; else if(cnt) { res[i-cnt]++; res[i-cnt+1]++; res[i]--; res[i+1]--; } } res.pop_back(); partial_sum(all(res),res.begin()); for(auto v : res) cout << v << ' '; return 0; }
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 | #include <bits/stdc++.h> #define fi first #define sc second #define pb push_back #define rep(i,p,k) for(int i=(p);i<(k);++i) #define forn(i,p,k) for(int i=(p);i<=(k);++i) #define forr(i,k,p) for(int i=(k)-1;i>=(p);--i) #define each(a,b) for(auto&a:b) #define all(v) begin(v), end(v) #define RET(smth) return void(cout<<(smth)<<'\n'); #define sz(v) (int)v.size() using namespace std; using pii = pair<int,int>; using ll = long long; using Vi = vector<int>; #ifdef DEBUG #include "debug.h" #else #define debug(...) ; #endif int main() { #ifndef DEBUG cin.tie(0) -> sync_with_stdio(0); #endif int n; cin >> n; string S; cin >> S; int cnt = 0; Vi res(n + 1); rep(i,0,n) { if(S[i] == 'P') cnt++; else if(cnt) { res[i-cnt]++; res[i-cnt+1]++; res[i]--; res[i+1]--; } } res.pop_back(); partial_sum(all(res),res.begin()); for(auto v : res) cout << v << ' '; return 0; } |