[PKU 3237]Tree(树链剖分)

【题目大意】：

跟QTREE一样，就是多了一个NEGATE操作，表示将A,B路径上的边权取负。

【题目分析】：

不要小看了这个取反，折腾了我将近一周……

问题在于取反了之后要怎么考虑新加进来的（就是改的边）。

解决方案不消说在线段树，他不是单纯的染色，所以我们为了让它保证正确性，就要牺牲下速度。

现在考虑我如果保证在进行完一个操作后，状态为反的区间为0个，要怎么办呢。我们记录一个flag,表示这个区间的max和min是在正的情况下还是在反得情况下。每次操作之前，为了避免错误，我们将反的取正，然后将它儿子的状态逆转过来，这样一定就是正确的了。说白了就是融合染色线段树的下穿和普通线段树RMQ的处理。

这题我交了N变，最开始完全就是脑残了，只记录最大值，忘了反转之后最小值还能变成最大值这码事~~导致我悲剧了一整天。

后来就是这个区间我想用统计反转次数的方法做，最终结果也是悲剧了，一旦中间有东西变了，就彻底完蛋。

后来，突发奇想用了XOR，才将这个问题解决……

P.s. XOR真是个神奇的运算啊…………

【代码】：

program PKU_3237; type ntype=record data,next,c,id:longint; end; ttype=record left,right,max,min,flag:longint; end; var x,y,w,n,i,tot,top,point,q,tt,ttt:longint; v:array[0..20000] of boolean; node:array[0..30000] of ntype; tree:array[0..80000] of ttype; g,size,max,rank,chain,setfather,locate:array[0..30000] of longint; num,links,father,data,belongs:array[0..30000] of longint; ques,lcaans:array[0..300000] of longint; flag:array[0..300000] of longint; opr:array[0..300000,1..2] of longint; node2:array[0..400000] of ntype; ch:char; function max2(x,y:longint):longint; begin if x>y then exit(x) else exit(y); end; function min2(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; tree[p].flag:=0; if left=right then begin tree[p].max:=chain[left]; tree[p].min:=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); tree[p].min:=min2(tree[p shl 1].min,tree[p shl 1+1].min); end; procedure down(p:longint); var k:longint; begin k:=tree[p].min; tree[p].min:=tree[p].max; tree[p].max:=k; tree[p].min:=-tree[p].min; tree[p].max:=-tree[p].max; tree[p].flag:=0; if tree[p].left<>tree[p].right then begin tree[p shl 1].flag:=tree[p shl 1].flag xor 1; tree[p shl 1+1].flag:=tree[p shl 1+1].flag xor 1; end; end; procedure refresh(p:longint); begin if tree[p].left=tree[p].right then exit; if tree[p shl 1].flag=1 then down(p shl 1); if tree[p shl 1+1].flag=1 then down(p shl 1+1); tree[p].max:=max2(tree[p shl 1].max,tree[p shl 1+1].max); tree[p].min:=min2(tree[p shl 1].min,tree[p shl 1+1].min); end; procedure insert(p,situ,x:longint); var mid:longint; begin if tree[p].flag=1 then down(p); if tree[p].left=tree[p].right then begin tree[p].max:=x; tree[p].min:=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); refresh(p); end; procedure negate(p,left,right:longint); var mid:longint; begin if tree[p].flag=1 then down(p); if (tree[p].left=left) and (tree[p].right=right) then begin tree[p].flag:=1; exit; end; mid:=(tree[p].left+tree[p].right) shr 1; if right<=mid then negate(p shl 1,left,right) else if left>mid then negate(p shl 1+1,left,right) else begin negate(p shl 1,left,mid); negate(p shl 1+1,mid+1,right); end; refresh(p); end; function find(p,left,right:longint):longint; var mid:longint; begin if tree[p].flag=1 then down(p); 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 find:=find(p shl 1,left,right) else if left>mid then find:=find(p shl 1+1,left,right) else find:=max2(find(p shl 1,left,mid),find(p shl 1+1,mid+1,right)); refresh(p); 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 lca,ans:longint; begin ans:=-maxlongint; 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; procedure cnegate(x,y:longint); var lca:longint; begin lca:=lcaans[i]; while x<>lca do begin if rank[x]=links[num[x]] then begin data[x]:=-data[x]; x:=father[x]; continue; end; if num[x]=num[lca] then begin negate(1,rank[lca]+1,rank[x]); break; end; negate(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 data[y]:=-data[y]; y:=father[y]; continue; end; if num[y]=num[lca] then begin negate(1,rank[lca]+1,rank[y]); break; end; negate(1,links[num[y]]+1,rank[y]); y:=locate[links[num[y]]]; end; 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); readln(n); point:=0; tot:=0; top:=0; for i:=1 to n-1 do begin readln(x,y,w); link(x,y,w); link(y,x,w); end; 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 for i:=1 to 4 do read(ch); inc(q); flag[q]:=1; readln(x,y); opr[q,1]:=x; opr[q,2]:=y; link2(x,y); link2(y,x); end; 'C':begin for i:=1 to 5 do read(ch); inc(q); flag[q]:=2; readln(opr[q,1],opr[q,2]); end; 'N':begin for i:=1 to 5 do read(ch); inc(q); flag[q]:=3; readln(x,y); opr[q,1]:=x; opr[q,2]:=y; link2(x,y); link2(y,x); end; 'D':begin readln; break; end; end; end; lca(1); for i:=1 to q do if flag[i]=1 then query(opr[i,1],opr[i,2]) else if flag[i]=2 then change(opr[i,1],opr[i,2]) else cnegate(opr[i,1],opr[i,2]); end; close(input); close(output); end.