1.双端队列+倒序插入
#include<iostream>
#include<deque>
using namespace std;
deque<int> q;
int main()
{
int n;
string s;
cin>>n>>s;
q.push_front(n);
for(int i=n-1;i>=0;i--)
{
if(s[i]=='L') q.push_back(i);
else q.push_front(i);
}
for(int i=0;i<=n;i++)
{
if(i==0) cout<<q[i];
else cout<<" "<<q[i];
}
return 0;
}
2.递归
#include <iostream>
#include <cmath>
#include <queue>
#include <cstring>
using namespace std;
const int N = 5e5+10;
typedef pair<int,int>PII;
char s[N];
int n;
void solve(int u){
if(u==n){
printf("%d ",u);
return ;
}
if(s[u+1]=='L'){
solve(u+1);
printf("%d ",u);
}
else {
printf("%d ",u);
solve(u+1);
}
}
int main() {
scanf("%d",&n);
scanf("%s",s+1);
if(s[1]=='L') {
solve(1);
printf("0 ");
}
else {
printf("0 ");
solve(1);
}
return 0;
}
2.链表
#include<iostream>
#include<cstring>
using namespace std;
int y[500010],z[500010];
int st[500010];
int main()
{
int n;
cin>>n;
string s;
cin>>s;
memset(z,-1,sizeof z);
memset(y,-1,sizeof y);
for(int i=0;i<n;i++)
{
if(s[i]=='L')
{
z[i+1]=z[i];
y[z[i]]=i+1;
z[i]=i+1;
y[i+1]=i;
}
else
{
y[i+1]=y[i];
z[y[i]]=i+1;
y[i]=i+1;
z[i+1]=i;
}
}
int k;
for(int i=0;i<=n;i++)
{
if(z[i]==-1) k=i;
}
//cout<<k<<endl;
for(int i=k;i!=-1;i=y[i])
{
if(i==k) cout<<i;
else cout<<" "<<i;
}
return 0;
}
3.字符串(超时)
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
cin>>s;
string ss="0";
int k=0;
for(int i=0;i<n;i++)
{
//int k=ss.find(i+'0');
if(s[i]=='L')
{
ss.insert(ss.begin()+k,i+1+'0');
}
else
{
ss.insert(ss.begin()+k+1,i+1+'0');
k++;
}
}
for(int i=0;i<ss.size();i++)
{
if(i==0) cout<<ss[i];
else cout<<" "<<ss[i];
}
return 0;
}