题目
代码:
#include<bits/stdc++.h>
using namespace std;
int q;
long long l,r;
map<int,long long>p;
int main(){
cin>>q;
q--;
char op;
int x;
cin>>op>>x;
p[x]=0;
l=x;
r=x;
while(q){
cin>>op>>x;
if(op=='L'){
p[x]=p[l]-1;
l=x;
}else if(op=='R'){
p[x]=p[r]+1;
r=x;
}else{
cout<<abs(min(p[x]-p[l],p[r]-p[x]))<<endl;
}
q--;
}
return 0;
}