#include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; if(n == 1){ cout << "0\n"; return 0; } string s; cin >> s; vector<int>left(n, 0), right(n, 0); vector<int>ans(n, 0); for(int i = 1; i < n; i++){ right[i] = right[i-1]; if(s[i-1] == 'P')right[i]++; } for(int i = n - 2; i >= 0; i--){ left[i] = left[i+1]; if(s[i + 1] == 'L')left[i]++; } for(int i = 0; i < n; i++){ int d = min(left[i], right[i]); ans[i] = 2 * d; left[i] -= d; right[i] -= d; if(s[i] == 'L' && right[i] > 0)ans[i]++; if(s[i] == 'P' && left[i] > 0)ans[i]++; } for(auto x : ans)cout << x << ' '; 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 | #include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; if(n == 1){ cout << "0\n"; return 0; } string s; cin >> s; vector<int>left(n, 0), right(n, 0); vector<int>ans(n, 0); for(int i = 1; i < n; i++){ right[i] = right[i-1]; if(s[i-1] == 'P')right[i]++; } for(int i = n - 2; i >= 0; i--){ left[i] = left[i+1]; if(s[i + 1] == 'L')left[i]++; } for(int i = 0; i < n; i++){ int d = min(left[i], right[i]); ans[i] = 2 * d; left[i] -= d; right[i] -= d; if(s[i] == 'L' && right[i] > 0)ans[i]++; if(s[i] == 'P' && left[i] > 0)ans[i]++; } for(auto x : ans)cout << x << ' '; return 0; } |