Tyvj 1039 忠诚2

2 0

const MaxN=100010;
type
tre=record
l,r,lc,rc,min:longint;{<左右边界、左右儿子、区间最小值>}
end;//tre
var
tree:array[0..MaxN*4] of tre;
n,m,i,j,x,a,b,root,tot,ans,p:longint;
procedure build(vart:longint;l,r:longint);{<建树>}
begin
inc(tot);t:=tot;
tree[t].l:=l;tree[t].r:=r;
tree[t].min:=maxlongint;
ifl<r then
begin
build(tree[t].lc,l,(l+r)div 2);
build(tree[t].rc,(l+r)div 2+1,r);
end;//if
end;
function min(a,b:longint):longint;
begin
ifa>b then exit(b);
exit(a);
end;
procedure insert(t,i:longint);{<插入>}
begin
ift=0 then exit;
iftree[t].l=tree[t].r then
begin
tree[t].min:=x;
exit;
end;
iftree[tree[t].lc].r>=i then insert(tree[t].lc,i)
else insert(tree[t].rc,i);
tree[t].min:=min(tree[tree[t].lc].min,tree[tree[t].rc].min);{<维护区间最小值>}
end;
procedure find(t,l,r:longint);{<查找>}
begin
ift=0 then exit;
if(tree[t].l=l)and(tree[t].r=r) then
begin
ifans>tree[t].min then ans:=tree[t].min;{<由于该区间可能跨越子树所以做下比较>}
exit;
end;
iftree[tree[t].lc].r>=r then find(tree[t].lc,l,r)
else
iftree[tree[t].rc].l<=l then find(tree[t].rc,l,r)
else
begin
find(tree[t].lc,l,tree[tree[t].lc].r);
find(tree[t].rc,tree[tree[t].rc].l,r);
end;
end;
begin
readln(m,n);
root:=0;tot:=0;
build(root,1,m);
fori:=1 to m do
begin
read(x);
insert(root,i);
end;
fori:=1 to n do
begin
readln(p,a,x);
ifp=1 then
begin
ans:=maxlongint;{<初始化maxlongint才能更新>}
find(root,a,x);
write(ans,' ');
end
else
begin
insert(root,a);{<改变第x个数为y也就是把y插入到x位置上，然后更新所涉及的子树>}
end;
end;
end.