#include<iostream>
#include<cstdio>
using namespace std;
const int N = 1005;
int a[N];
int n;
void forward(int p, int q){
for(int i = 0; i < n; i ++){
if(a[i]==p){
for(int j = i; j >= i - q + 1; j--){
a[j] = a[j-1];
}
a[i-q] = p;
break;
}
}
}
void back(int p, int q){
for(int i = 0; i < n; i ++){
if(a[i]==p){
for(int j = i; j <= i + q - 1; j++){
a[j] = a[j+1];
}
if(i+q<n)
a[i+q] = p;
break;
}
}
}
int main(){
int m;
int p,q;
cin >> n >> m;
for(int i = 0; i < n; i++){
a[i] = i+1;
}
while(m--){
cin >> p >> q;
if(q < 0)
forward(p,-q);
else if(q > 0)
back(p,q);
}
for(int i = 0; i < n-1; i++){
cout << a[i] << " ";
}
cout << a[n-1] << endl;
return 0;
}
CCF201703-02
最新推荐文章于 2023-03-20 18:26:10 发布