ccf 学生排队

/*就是比较水的一道题，但我做了一个半小时才100分。。。
*/

include

include

include

include

include

include

using namespace std;
//*****************
///o(っ。Д。)っ AC万岁！！！
const int maxn = 1002;
int a[maxn] = {}, book[maxn] = {};
int main()
{
int n;
while(~scanf(“%d”, &n))
{
for(int i = 1; i <= n; i++)
{
a[i] = i;
book[i] = i;
}
int k, pos, shift;
scanf(“%d”, &k);
for(int i = 1; i <= k; i++)
{
scanf(“%d %d”, &pos, &shift);
pos = book[pos];
int pos2 = pos + shift;
int d = shift > 0 ? 1 : -1;
int temp = a[pos];
for(int j = pos; j != pos2; j += d)
{
a[j] = a[j + d];
book[a[j]] = j;
}
a[pos2] = temp;
book[temp] = pos2;
}
for(int i = 1; i < n; i++)
{
printf(“%d “, a[i]);
}
printf(“%d\n”, a[n]);
}
return 0;
}