用treap写了写

 1 program hehe;
 2 type
 3  shu=record
 4   l,r,w,h,y,s:longint;
 5  end;
 6 var
 7  n,i,j,k,t,ans,root,size:longint;
 8  x:array[0..100000] of shu;
 9 
10   procedure update(a:longint);
11   begin
12    x[a].s:=x[x[a].l].s+x[x[a].r].s+x[a].w;
13   end;
14 
15   procedure rturn(var a:longint);
16   var
17    t:longint;
18   begin
19    t:=x[a].l;
20    x[a].l:=x[t].r;
21    x[t].r:=a;
22    x[t].s:=x[a].s;
23    update(a);
24    a:=t;
25   end;
26 
27   procedure lturn(var a:longint);
28   var
29    t:longint;
30   begin
31    t:=x[a].r;
32    x[a].r:=x[t].l;
33    x[t].l:=a;
34    x[t].s:=x[a].s;
35    update(a);
36    a:=t;
37   end;
38 
39   procedure insert(var a:longint;b:longint);
40   begin
41    if a=0 then
42    begin
43     inc(size);
44     a:=size;
45     x[a].s:=1;
46     x[a].w:=1;
47     x[a].h:=b;
48     x[a].y:=random(maxlongint);
49     exit;
50    end;
51    inc(x[a].s);
52    if x[a].h=b then inc(x[a].w)
53    else if b>x[a].h then
54    begin
55     insert(x[a].r,b);
56     if x[x[a].r].y<x[a].y then lturn(a);
57    end
58    else
59    begin
60     insert(x[a].l,b);
61     if x[x[a].l].y<x[a].y then rturn(a);
62    end;
63   end;
64 
65   function find(a,b:longint):boolean;
66   begin
67    if a=0 then exit(false);
68    if x[a].h=b then exit(true);
69    if b>x[a].h then exit(find(x[a].r,b));
70    exit(find(x[a].l,b));
71   end;
72 
73 begin
74  readln(t);
75  for i:=1 to t do
76  begin
77   read(n);
78   root:=0;
79   size:=0;
80   fillchar(x,sizeof(x),0);
81   for j:=1 to n do
82   begin
83    read(k);
84    if not find(root,k) then
85    if j=1 then write(k)
86    else write(‘ ‘,k);
87    insert(root,k);
88   end;
89   writeln;
90  end;
91 end.