abc237 D(想了一个小时结果跟模拟双向链表的插入一毛一样，老废物了，思路不清晰，建议remake)

题目
题意: 给定长度为n的操作序列，对一个数字序列进行操作。数字序列初始只有0，包含两种操作。
L: 插入i 到i-1左边
R: 插入i到i-1右边
思路: 用双端队列维护，倒着逆操作。但是我没有想到这么神仙的做法，想了半天，然后开始乱写，就硬乱写。没有捋清楚思路，边想边调。最后发现写了一个双向链表的插入。。。写了一小时，什么菜鸡啊。
时间复杂度: O(n)
代码:

// Problem: D - LR insertion
// Contest: AtCoder - AtCoder Beginner Contest 237
// URL: https://atcoder.jp/contests/abc237/tasks/abc237_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 5e5+10;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
vector<int> va[N];
int fa[N];
char s[N];
int l[N];
int r[N];
int find(int x)
{
	return x==fa[x]?x:fa[x] = find(fa[x]);
}
void Merge(int u,int v)
{
	u = find(u),v = find(v);
	if(u != v)
	{
		fa[v] = u;
	}
}
bool vis[N];
void dfs(int cur)
{
	vector<int> vv;
	int tmp = cur;
	vv.push_back(tmp);
	while(true)
	{
		int j = l[tmp];
	   	if(j == -1 || vis[j]) break;
	   	vis[j] = true;
	   	vv.push_back(j);
	   	tmp = j;
	}
	reverse(vv.begin(),vv.end());
	for(auto item:vv) write(item),putchar(' ');
	if(!vis[r[cur]] && r[cur] != -1)
	{
		vis[r[cur]] = 1;
		dfs(r[cur]);
	}
}
void print(int now)
{
	if(now == -1) return ;
	write(now),putchar(' ');
	print(r[now]);
}
void solve()
{
   mem(l,-1); mem(r,-1);
   read(n);
   fir(i,0,n) fa[i] = i;
   scanf("%s",s+1);
   for(int i=1;i<=n;++i)
   {
   	 char ch = s[i];
   	 if(ch == 'L')
   	 {
   	 	if(l[i-1] != -1) l[i] = l[i-1],r[l[i-1]] = i;
   	 	l[i-1] = i;
   	 	r[i] = i-1;
   	 	
   	 }
   	 else 
   	 {
   	 	if(r[i-1] != -1) r[i] = r[i-1],l[r[i-1]] = i;
   	 	r[i-1] = i;
   	 	l[i] = i-1;
   	 }
   }
   // for(int i=0;i<=n;++i)
   // {
   	 // cout<<i<<":"<<l[i]<<" "<<r[i]<<endl;
   // }
   for(int i=0;i<=n;++i)
   {
   	 if(l[i] == -1) 
   	 {
   	 	print(i);
   	 	return ;
   	 }
   }
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<stack>
#include<queue> 

using namespace std;

int main()
{
	deque<int> q;
	
	int n;
	cin >> n;
	string s;
	cin >> s;
	
	q.push_back(n);
	for(int i = n - 1; i >= 0; i --)
	{
		if(s[i] == 'L') 
			q.push_back(i);
		else
			q.push_front(i);	
	}
	for(auto &x : q) cout << x << ' ';

	return 0;
}