1722D.cpp

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        string s;
        cin >> n >> s;

        ll base_value = 0;
        vector<ll> gains;

        for (int i = 0; i < n; i++) {
            if (s[i] == 'L') {
                base_value += i;
                gains.push_back((n - i - 1) - i);
            } else {
                base_value += n - i - 1;
                gains.push_back(i - (n - i - 1));
            }
        }

        sort(gains.rbegin(), gains.rend()); 

        vector<ll> result(n);
        ll current_value = base_value;

        for (int k = 0; k < n; k++) {
            if (gains[k] > 0) {
                current_value += gains[k];
            }
            result[k] = current_value;
        }

        for (ll x : result) {
            cout << x << " ";
        }
        cout << '\n';
    }

    return 0;
}