两题动态树

  

很神奇的一种数据结构。又是tarjan发明的。。orz。

我才知道，动态树不是数据结构，而是一类问题的称呼。。

以往动态树相关问题的觉得很难，也没有写，

其实没有想象的那么难，而且代码容易写（指的是基于splay的动态树）

非常轻松的一次ac弹飞绵羊

非常不容易的ac树的统计count。。我很快写完了，结果看了很久才知道自己错在哪里（这真的是无比浪费时间）。

因为它有负数，所以空节点，也就是0，初始给他一个-max的值。。。。动态树是没有写挫的- -反而挂在最基础的地方，

树的统计一共跑了5s才出解。。求助更快的link-cut tree写法。。

 

 program p2002;//弹飞绵羊 var n:longint; s,fa:Array[0..200000]of longint; son:Array[0..200000,0..1]of longint; procedure init; var i:longint; begin readln(n); for i:=1 to n do begin read(fa[i]); inc(fa[i],i); if fa[i]>n then fa[i]:=n+1; end; for i:=1 to n+1 do s[i]:=1; end; procedure rorate(X,p:longint); var y,z:longint; begin y:=fa[x]; z:=son[x,p]; son[y,1-p]:=z; if z<>0 then fa[z]:=y; fa[x]:=fa[y]; if y=son[fa[y]][0] then son[fa[y]][0]:=x else if y=son[fa[y]][1] then son[fa[y]][1]:=x; fa[y]:=x; son[x][p]:=y; s[y]:=s[son[y,0]]+s[son[y,1]]+1; s[x]:=s[son[x,0]]+s[son[x,1]]+1; end; procedure splay(x:longint); var y,z :longint; begin while (fa[x]<>0)and((x=son[fa[x]][0])or(x=son[fa[x]][1])) do begin y:=fa[x]; z:=fa[y]; if (z=0)or(y<>son[z][0])and(y<>son[z][1]) then if x=son[y,0] then rorate(x,1) else rorate(x,0) else if y=son[z][0] then if x=son[y][0] then begin rorate(y,1); rorate(x,1);end else begin rorate(x,0);rorate(x,1);end else if x=son[y][1] then begin rorate(y,0); rorate(x,0);end else begin rorate(x,1);rorate(x,0);end; end; son[0][0]:=0; son[0][1]:=0 end; procedure access(X:longint); var y:longint; begin y:=0; while x<>0 do begin splay(x); son[x,1]:=y; y:=x; x:=fa[x]; end; end; procedure main; var ask,x,y,k:longint; begin readln(ask); for ask:=1 to ask do begin read(k,x); inc(x); if k=1 then begin access(X); splay(X); writeln(s[son[x,0]]); end else begin read(y); splay(x); fa[son[x,0]]:=fa[x]; son[x,0]:=0; s[x]:=s[son[x,1]]+1; fa[x]:=x+y; if fa[x]>n then fa[x]:=n+1; end; end; end; begin init; main; end.

 

 

 

program p1036;//树的统计 {$m 100000000} const maxn=40000; var ans1,ans2,tot,n:longint; ch:char; fa,first,max,sum,w:Array[0..maxn]of longint; bian:Array[0..maxn*2] of record x,y,next:longint;end; son:Array[0..maxn,0..1]of longint; v:array[0..maxn]of boolean; procedure connect(x,y:longint); begin inc(tot);bian[tot].x:=x;bian[tot].y:=y;bian[tot].next:=first[x];first[x]:=tot; end; procedure dfs(X:longint); var k:longint; begin v[x]:=true; k:=first[x]; while k<>0 do with bian[k] do begin if not v[y] then begin fa[y]:=x; dfs(y); end; k:=next; end; end; procedure init; var i,x,y:longint; begin readln(n); for i:=1 to n-1 do begin readln(X,y); connect(x,y); connect(y,x); end; for i:=1 to n do read(w[i]); for i:=1 to n do sum[i]:=w[i]; for i:=1 to n do max[i]:=sum[i]; dfs(1); end; function bigger(a,b:longint):longint; begin if a>b then exit(a) else exit(B); end; procedure updata(x:longint); begin max[x]:=bigger(max[son[x][1]],max[son[x][0]]); max[x]:=bigger(max[x],w[x]); sum[x]:=w[x]+sum[son[x][1]]+sum[son[x][0]]; end; procedure rorate(x,p:longint); var y,z:longint; begin y:=fa[x]; z:=son[x][p]; son[y][1-p]:=z; if z<>0 then fa[z]:=y; fa[x]:=fa[y]; if y=son[fa[y]][0] then son[fa[y]][0]:=x; if y=son[fa[y]][1] then son[fa[y]][1]:=x; fa[y]:=x; son[x][p]:=y; updata(y); end; procedure splay(x:longint); var y,z:longint; begin while (fa[x]<>0)and((x=son[fa[x]][0])or(x=son[fa[x]][1])) do begin y:=fa[x];z:=fa[y]; if (Z=0)or(y<>son[z][0])and(y<>son[z][1]) then if x=son[y][1] then rorate(x,0) else rorate(x,1) else if y=son[z][0] then if x=son[y][0] then begin rorate(y,1);rorate(x,1); end else begin rorate(x,0);rorate(x,1); end else if x=son[y][1] then begin rorate(y,0);rorate(x,0);end else begin rorate(x,1);rorate(x,0);end end; updata(x); end; procedure access(X,y:longint); var u,v:longint; begin u:=x;v:=0; while u<>0 do begin splay(u); son[u,1]:=v; updata(u); v:=u;u:=fa[u]; end; u:=y;v:=0; while u<>0 do begin splay(u); if fa[u]=0 then begin ans1:=w[u];ans2:=w[u]; if v<>0 then begin ans1:=bigger(ans1,max[v]); inc(ans2,sum[v]); end; if son[u][1]<>0 then begin ans1:=bigger(ans1,max[son[u][1]]); inc(ans2,sum[son[u][1]]); end; end; son[u,1]:=v; updata(u); v:=u;u:=fa[u]; end; end; procedure main; var ask,x,y,i:longint; ch:char; begin readln(ask); max[0]:=-maxlongint shr 1; for ask:=1 to ask do begin read(ch); if ch='C' then begin for i:=1 to 5 do read(ch); readln(x,y); splay(x); w[x]:=y; updata(x); end else begin for i:=1 to 3 do read(ch); readln(x,y); access(x,y); case ch of 'X':writeln(ans1); 'M':writeln(Ans2); end; end; end; end; begin init; main; end.