201703-2-学生排队

#include<cstdio>
#include<iostream>

const int MAX = 1005;
using namespace std;

typedef struct node{
    int x;
    int pre, next;
}Node;

//整个例子时间主要用于指向下一个节点的过程，代码：46行，66行 
int main()
{
    int n,m,p,q,i,j=0;
    //在结构体中，学号既是数组下标也是值，所以说，其实值是多余的存在，这样子在查找符合对应学号的学生时，
    //就避免了链表的查询速度慢的缺点
    //使用结构体创建链表避免了数组移动速度慢的缺点
    Node stu1[MAX];
    scanf("%d",&n);
    stu1[0].pre = -1;
    stu1[0].x = n;
    stu1[0].next = 1;//通过首节点找到整条链表 
    for(i = 1;i <= n;i++)//初始化 
    {
        stu1[i].x = i;
        stu1[i].pre = i-1;
        if(i+1 <= n)//结尾 
            stu1[i].next = i+1;
        else
            stu1[i].next = -1; 
    }
    int pr,ne;
    scanf("%d",&m);
    while(m > 0)
    {
        scanf("%d %d",&p,&q);
        j = p;
        if(q > 0)//学号为p的同学向后移动q 
        {
            pr = stu1[j].pre;
            ne = stu1[j].next;
            stu1[pr].next = stu1[j].next; 
            stu1[ne].pre = stu1[j].pre;
            i = j;
            while(q > 0)
            {
                j = stu1[j].next;
                q--;
            }
            ne = stu1[j].next;
            stu1[j].next = i;
            stu1[i].pre = j;
            stu1[i].next = ne;
            if(ne != -1)//如果不是最后一个节点 
                stu1[ne].pre = i;
        }
        else//学号为p的同学向前移动-q 
        {
            q = -q;
            pr = stu1[j].pre;
            ne = stu1[j].next;
            stu1[pr].next = stu1[j].next;
            stu1[ne].pre = stu1[j].pre;
            i = j;
            while(q > 0)
            {
                j = stu1[j].pre;
                q--;
            }
            pr = stu1[j].pre;
            stu1[j].pre = i;
            stu1[pr].next = i;
            stu1[i].pre = pr;
            stu1[i].next = j;
        }
        m--;
    } 
    i = 0;
    i = stu1[i].next;
    while(i != -1)
    {
        printf("%d ",stu1[i].x);
        i = stu1[i].next;
    }
    
    return 0;
}