2016/10/13 1000. 移动小球

很典型的算法题，用L R两个数组记录每个球对应的左边和右边的球标号，移动时只需要改变L R 的值即可。输出时找到最左边的后，输出它的R的值。

#include <iostream>
using namespace std;
int L[500001],R[500001] = {1};
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n, m;
		cin >> n >> m;
		for (int i = 1; i <= n; i++)
		{
			L[i] = i - 1;
			R[i] = i + 1;
		}
		while (m--)
		{
			int a, X, Y;
			cin >> a >> X >> Y;
			if (a == 1)
			{
				L[R[X]] = L[X];
				R[L[X]] = R[X];
				R[L[Y]] = X;
				L[X] = L[Y];
				L[Y] = X;
				R[X] = Y;
			}
			else if (a == 2)
			{
				L[R[X]] = L[X];
				R[L[X]] = R[X];
				L[X] = Y;
				L[R[Y]] = X;
				R[X] = R[Y];
				R[Y] = X;
			}
		}
		for (int i = 1; i <= n; i++)
		{
			if (L[i] == 0)
			{
				cout << i << " ";
				int count = 1;
				int temp = i;
				while (count != n)
				{
					cout << R[temp] << " ";
					temp = R[temp];
					count++;
				}
				break;
			}
		}
		cout << endl;
	}
}