[SPOJ 375]Query On a Tree(树链剖分)

【题目大意】：

给你一个有权无根树，使之可以实现动态的修改一些边的权值，以及询问节点x，y的路径上权值最大边的权值。

【题目分析】：

3小时~255行……累死我了……

我做过的几个悲剧题目之一……

我写的还算比较快，应该说（我用了3个小时写完并调试的……）

但是确实很费脑，虽然比较好理解，但是确实很悲剧…………

树链剖分是个很nb的东西，主要思想就是将树拆开，拆成链，然后再在链上进行操作。

这题是线段树，想法很简单，但是真的不是很好写……

我的代码果然没有Matt神牛的动态树快，3.92s貌似很悲剧的样子。

但是仅仅交了两次就AC了…………我很欣慰的说…………

纳米神牛给我的datamaker有bug，害得我找了n久并没错的程序……

我会再写一篇日志详细的讲解有关树链剖分的内容，下面是提交结果以及代码。

3490355

2010-04-10 16:19:22

Query on a tree

accepted

3.92

9.8M

PAS fpc

【代码】：

program qtree; type ntype=record data,next,c,id:longint; end; ttype=record left,right,max:longint; end; var x,y,w,n,i,tot,top,point,q,tt,ttt:longint; v:array[1..10000] of boolean; node:array[1..20000] of ntype; tree:array[1..50000] of ttype; g,size,max,rank,chain,setfather,locate:array[1..20000] of longint; num,links,father,data,belongs:array[1..20000] of longint; ques,lcaans:array[1..200000] of longint; flag:array[1..200000] of boolean; opr:array[1..200000,1..2] of longint; node2:array[1..300000] of ntype; ch:char; function max2(x,y:longint):longint; begin if x>y then exit(x) else exit(y); end; procedure link(x,y,w:longint); begin inc(point); node[point].data:=y; node[point].c:=w; node[point].id:=i; node[point].next:=g[x]; g[x]:=point; end; procedure link2(x,y:longint); begin inc(point); node2[point].data:=y; node2[point].id:=q; node2[point].next:=ques[x]; ques[x]:=point; end; function findfa(x:longint):longint; begin if setfather[x]=x then exit(x); setfather[x]:=findfa(setfather[x]); exit(setfather[x]); end; procedure buildtree(p,left,right:longint); var mid:longint; begin tree[p].left:=left; tree[p].right:=right; if left=right then begin tree[p].max:=chain[left]; exit; end; mid:=(left+right) shr 1; buildtree(p shl 1,left,mid); buildtree(p shl 1+1,mid+1,right); tree[p].max:=max2(tree[p shl 1].max,tree[p shl 1+1].max); end; procedure insert(p,situ,x:longint); var mid:longint; begin if tree[p].left=tree[p].right then begin tree[p].max:=x; exit; end; mid:=(tree[p].left+tree[p].right) shr 1; if situ<=mid then insert(p shl 1,situ,x) else insert(p shl 1+1,situ,x); tree[p].max:=max2(tree[p shl 1].max,tree[p shl 1+1].max); end; function find(p,left,right:longint):longint; var mid:longint; begin if (tree[p].left=left) and (tree[p].right=right) then exit(tree[p].max); mid:=(tree[p].left+tree[p].right) shr 1; if right<=mid then exit(find(p shl 1,left,right)) else if left>mid then exit(find(p shl 1+1,left,right)) else exit(max2(find(p shl 1,left,mid),find(p shl 1+1,mid+1,right))); end; procedure dfs(x:longint); var p:longint; begin v[x]:=true; size[x]:=1; max[x]:=0; p:=g[x]; while p<>0 do begin if not v[node[p].data] then begin father[node[p].data]:=x; dfs(node[p].data); data[node[p].data]:=node[p].c; belongs[node[p].id]:=node[p].data; inc(size[x],size[node[p].data]); if size[node[p].data]>size[max[x]] then max[x]:=node[p].data; end; p:=node[p].next; end; end; procedure cut(x:longint); var p:longint; begin v[x]:=true; inc(top); chain[top]:=data[x]; locate[top]:=x; rank[x]:=top; if x=max[father[x]] then num[x]:=num[father[x]] else begin inc(tot); num[x]:=tot; links[tot]:=top; end; p:=g[x]; while p<>0 do begin if node[p].data=max[x] then begin cut(node[p].data); break; end; p:=node[p].next; end; p:=g[x]; while p<>0 do begin if not v[node[p].data] then cut(node[p].data); p:=node[p].next; end; end; procedure lca(x:longint); var p:longint; begin setfather[x]:=x; v[x]:=true; p:=ques[x]; while p<>0 do begin if setfather[node2[p].data]<>0 then lcaans[node2[p].id]:=findfa(node2[p].data); p:=node2[p].next; end; p:=g[x]; while p<>0 do begin if setfather[node[p].data]=0 then begin lca(node[p].data); setfather[node[p].data]:=x; end; p:=node[p].next; end; end; procedure change(x,y:longint); begin data[belongs[x]]:=y; insert(1,rank[belongs[x]],y); end; procedure query(x,y:longint); var ans,lca:longint; begin ans:=0; lca:=lcaans[i]; while x<>lca do begin if rank[x]=links[num[x]] then begin if data[x]>ans then ans:=data[x]; x:=father[x]; continue; end; if num[x]=num[lca] then begin ans:=max2(ans,find(1,rank[lca]+1,rank[x])); break; end; ans:=max2(ans,find(1,links[num[x]]+1,rank[x])); x:=locate[links[num[x]]]; end; while y<>lca do begin if rank[y]=links[num[y]] then begin if data[y]>ans then ans:=data[y]; y:=father[y]; continue; end; if num[y]=num[lca] then begin ans:=max2(ans,find(1,rank[lca]+1,rank[y])); break; end; ans:=max2(ans,find(1,links[num[y]]+1,rank[y])); y:=locate[links[num[y]]]; end; writeln(ans); end; begin assign(input,'a.in'); assign(output,'a.out'); reset(input); rewrite(output); readln(tt); for ttt:=1 to tt do begin fillchar(v,sizeof(v),0); fillchar(tree,sizeof(tree),0); fillchar(g,sizeof(g),0); fillchar(max,sizeof(max),0); fillchar(rank,sizeof(rank),0); fillchar(setfather,sizeof(setfather),0); fillchar(data,sizeof(data),0); fillchar(belongs,sizeof(belongs),0); fillchar(ques,sizeof(ques),0); fillchar(flag,sizeof(flag),0); readln(n); point:=0; for i:=1 to n-1 do begin readln(x,y,w); link(x,y,w); link(y,x,w); end; tot:=0; top:=0; dfs(1); fillchar(v,sizeof(v),0); cut(1); buildtree(1,1,top); point:=0; q:=0; while true do begin read(ch); case ch of 'Q':begin inc(q); for i:=1 to 4 do read(ch); flag[q]:=true; readln(x,y); opr[q,1]:=x; opr[q,2]:=y; link2(x,y); link2(y,x); end; 'C':begin inc(q); for i:=1 to 5 do read(ch); readln(opr[q,1],opr[q,2]); end; 'D':begin readln; break; end; end; end; lca(1); for i:=1 to q do if flag[i] then query(opr[i,1],opr[i,2]) else change(opr[i,1],opr[i,2]); end; close(input); close(output); end.

P.s.可以看看这个版本的代码高亮，也很不错~

http://ideone.com/6wyt5#