csp-17-3-2 學生排隊
阿新 • • 發佈:2019-01-06
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn=100001;
int n;
int student[maxn];
int main(int argc, char** argv) {
scanf("%d",&n);
for(int i=1;i<=n;i++) student[i]=i; //init the student;
int time;
scanf("%d",&time);
for(int i=0;i<time;i++){
int pos1,change;
scanf("%d %d",&pos1, &change);
int pos;
for(int i=1;i<=n;i++){
if(student[i]==pos1){
pos=i;
break;
}
}
int temp=student[pos];
//把中間的向前向後移動;
if(change > 0){
for(int i=pos+1; i<=pos+change;i++) { //向後移動
student[i-1] = student[i];
}
swap(temp,student[pos+change]);
}else{
for(int i=pos-1;i>=pos+change;i--){ //向前移動;
student[i+1]=student[i];
}
swap(temp,student[pos+change]);
}
//for(int i=1;i<=n;i++){
//printf("%d",student[i]);
//if(i!=n) printf(" ");
//}
//putchar('\n');
}
//putchar('\n');
for(int i=1;i<=n;i++){
printf("%d",student[i]);
if(i!=n) printf(" ");
}
return 0;
}
#include <cstdio>
using namespace std;
const int maxn=100001;
int n;
int student[maxn];
int main(int argc, char** argv) {
scanf("%d",&n);
for(int i=1;i<=n;i++) student[i]=i; //init the student;
int time;
scanf("%d",&time);
for(int i=0;i<time;i++){
int pos1,change;
scanf("%d %d",&pos1, &change);
int pos;
for(int i=1;i<=n;i++){
if(student[i]==pos1){
pos=i;
break;
}
}
int temp=student[pos];
//把中間的向前向後移動;
if(change > 0){
for(int i=pos+1; i<=pos+change;i++) { //向後移動
student[i-1] = student[i];
}
swap(temp,student[pos+change]);
}else{
for(int i=pos-1;i>=pos+change;i--){ //向前移動;
student[i+1]=student[i];
}
swap(temp,student[pos+change]);
}
//for(int i=1;i<=n;i++){
//printf("%d",student[i]);
//if(i!=n) printf(" ");
//}
//putchar('\n');
}
//putchar('\n');
for(int i=1;i<=n;i++){
printf("%d",student[i]);
if(i!=n) printf(" ");
}
return 0;
}