#include <iostream>
#include <vector>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
string directions;
cin >> n >> directions;
vector<int> collisions(n, 0);
int l = 0, p = n - 1;
while (true){
while (directions[l] == 'L') l++;
while (directions[p] == 'P') p--;
if (l >= p) break;
for (int i = l + 1; i <= p; i++){
if (directions[i - 1] == 'P' && directions[i] == 'L'){
collisions[i - 1]++;
collisions[i]++;
directions[i - 1] = 'L';
directions[i] = 'P';
i++;
}
}
}
for (int i = 0; i < n; i++){
cout << collisions[i] << " ";
}
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 | #include <iostream> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; string directions; cin >> n >> directions; vector<int> collisions(n, 0); int l = 0, p = n - 1; while (true){ while (directions[l] == 'L') l++; while (directions[p] == 'P') p--; if (l >= p) break; for (int i = l + 1; i <= p; i++){ if (directions[i - 1] == 'P' && directions[i] == 'L'){ collisions[i - 1]++; collisions[i]++; directions[i - 1] = 'L'; directions[i] = 'P'; i++; } } } for (int i = 0; i < n; i++){ cout << collisions[i] << " "; } return 0; } |
English