学生排队
Time limit:1s
Memory limit:256MB
ac代码:
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,p,q;
int note[1005];
int que[1005];
void init(){
cin>>n>>m;
for(int i = 1;i <= n;++i)
note[i] = que[i] = i;
}
void solve(){
cin>>p>>q;
int k = note[p];
if(q > 0)
for(int i = k,j = k + q;i < j;++i)
que[i] = que[i + 1],--note[que[i + 1]];
else
for(int i = k,j = k + q;i > j;--i)
que[i] = que[i - 1],++note[que[i - 1]];
note[p] = k + q;
que[k + q] = p;
}
int main(){
init();
while(m--)
solve();
for(int i = 1;i <= n;++i)
cout<<que[i]<<" ";
return 0;
}