Line.cpp

/* 
AUTHOR: Antarikshya Mitra
TIME: 
PROBLEM NO:- Line Div4 D
*/


#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int MOD = 1e9 + 7; 


class cmp {
	public:
	bool operator()(const pair<int,int>&a,const pair<int,int> &b)
	{
		if(a.second<b.second) return true;
		else return false;
	}
};




void solve()
{
    int n;
    cin >> n;

    string s;
    cin >> s;

    vector<long long> gain(n);
    long long sum = 0;

    for(int i = 0; i < n; i++)
    {
        long long curr, flip;

        if(s[i] == 'L') {
            curr = i;
            flip = n - 1 - i;
        } else {
            curr = n - 1 - i;
            flip = i;
        }

        sum += curr;
        gain[i] = flip - curr;
    }

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

    for(int i = 0; i < n; i++)
    {
        if(gain[i] > 0)
            sum += gain[i];

        cout << sum << " ";
    }
    cout << "\n";
}
int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		solve();
	}	
	return 0;
}