1 #include <stdio.h>
  2 #include <stdlib.h>
  3 #include <iostream>
  4 using namespace std;
  5 #include <string.h>
  6
  7 #define MAXN 100002
  8
  9 struct Node
 10 {
 11     Node(int _data)
 12         :data(_data),bef(NULL),next(NULL){}
 13     int data;
 14     Node *bef;//before
 15     Node *next;
 16 };
 17
 18 Node *addr[MAXN] = {0};
 19 Node *head = NULL, *tail = NULL;
 20
 21 void Init();
 22 void Insert(int &prenum,int &thisnum);
 23 void Eat(int &start,int &num);
 24 void DisAll();
 25
 26 int main()
 27 {
 28     Init();
 29     DisAll();
 30
 31     return 0;
 32 }
 33
 34 void Init()
 35 {
 36     int i=0,j=0;
 37     int opnum=0,op=0,hbbnum=1;
 38     int a=0,b=0;
 39
 40     scanf("%d",&opnum);
 41     head = new Node(-1);
 42     tail = head;
 43
 44     for(i=1;i<=opnum;i++)
 45     {
 46         scanf("%d",&op);
 47         if(op==1)
 48         {
 49             scanf("%d",&a);
 50             Insert(a,hbbnum);
 51             ++hbbnum;
 52         }
 53         else//op==2
 54         {
 55             scanf("%d %d",&a,&b);
 56             Eat(a,b);
 57         }
 58 //        DisAll();
 59     }
 60 }
 61
 62 void Insert(int &prenum,int &thisnum)
 63 {
 64     Node *pnew = new Node(thisnum);
 65     if(addr[prenum] && addr[prenum]->next)//要找的数存在 且 不是最后一个
 66     {
 67         addr[thisnum] = pnew;
 68         pnew->next = addr[prenum]->next;
 69         addr[prenum]->next->bef = pnew;
 70         pnew->bef = addr[prenum];
 71         addr[prenum]->next = pnew;
 72     }
 73     else//数不存在 或 数是最后一个
 74     {
 75         addr[thisnum] = pnew;
 76         pnew->bef = tail;
 77         tail->next = pnew;
 78         tail = pnew;
 79     }
 80 }
 81
 82 void Eat(int &start,int &num)
 83 {
 84     int i;
 85     Node *p;
 86     if(addr[start]==NULL)//要找的数不存在，从头开始删
 87     {
 88         for(i=1, p=head->next; p && i<=num; i++, p=p->next)
 89         {
 90             addr[p->data] = NULL;
 91         }
 92         head->next = p;
 93         if(p==NULL) tail = head;
 94         else        p->bef = head;
 95     }
 96     else//找的数存在，获取地址，开始删
 97     {
 98         Node *pl = addr[start]->bef;
 99         for(i=1, p=addr[start]; p && i<=num; i++, p=p->next)
100         {
101             addr[p->data] = NULL;
102         }
103         pl->next = p;
104         if(p==NULL) tail = pl;
105         else         p->bef = pl;
106     }
107 }
108
109 void DisAll()
110 {
111     for(Node *p = head->next; p; p=p->next)
112     {
113         if(p==head->next)
114             printf("%d",p->data);
115         else
116             printf(" %d",p->data);
117     }
118 }