6-2-2 移动的小球(数组模拟链表实现)

#include <cstdio>#include <iostream>#define MAXN 500001using namespace std;int Left[MAXN];int Right[MAXN];void link(int X,int Y);int main(){int X,Y,n,m;char *chOP;scanf("%d %d",&n,&m);for(int i=1;i<=n;i++){link(i,i+1);}link(n,1);for(int i=0;i<m;i++){scanf("%s %d %d",chOP,&X,&Y);link(Left[X],Right[X]);if(chOP[0]=='A'){link(Left[Y],X);link(X,Y);}else{link(X,Right[Y]);link(Y,X);}}int t=1;for(int i=0;i<n;i++){cout<<t;t=Right[t];}cout<<endl;return 0;}void link(int X,int Y){Right[X]=Y;Left[Y]=X;}