【集训题1025——选木材】树的分治、单调队列

题意：

   求一棵树上一条长度为L~R之间的权值最大的路径，长度是这条路径上的边数，N<=100000，L<=R<=N

分析：

   直接树形dp难度较大，由于是求一条树中XX路径，容易想到树的分治（详见QZC论文）

算法

   这里讲一种基于点的分治，选树的重心为根，先算出经过自己的路径更新答案，再递归到子树

   顺序处理每个子树，先搜出这棵子树中长度为1~r的所有路径，用个数组存之前的每个深度的路径最大权值，拿当前这棵子树去“合”上句话那个数组，“合”完之后再用当前子树的信息区更新“那个数组”，“合”的过程相当于一次dp，即在两个线性表中取max{a[i]+b[j],l<=i+j<=r}，用单调队列实现。

   为了搞笑，我编了个线段数来“合”，为此盾哥赔了我10个鸡块，哈哈，线段树都1.5s过了（单调队列0.2s）

代码（线段树）：

{$M 10000000} {$inline on} program syj; uses math; const oo=maxlongint>>1; var i,x,y,z,ed,n,lc,rc,e,tot,minx,mi,ans,t:longint; h,qd,qs,son,si:array[1..100005]of longint; next,point,w,l,r,b,bb,ma:array[1..300005]of longint; v:array[1..100005]of boolean; procedure dfs1(i,fa,dep,s:longint); inline; var j,k:longint; begin if dep<=rc then begin inc(ed);qd[ed]:=dep;qs[ed]:=s; end; j:=h[i]; son[i]:=1; while j<>0 do begin k:=point[j]; if (k<>fa)and not v[k] then begin dfs1(k,i,dep+1,s+w[j]); inc(son[i],son[k]); end; j:=next[j]; end; end; procedure dfs2(i,fa:longint); inline; var j,k,mins:longint; begin mins:=tot-son[i]; j:=h[i]; while j<>0 do begin k:=point[j]; if (k<>fa)and not v[k] then begin dfs2(k,i); if son[k]>mins then mins:=son[k]; end; j:=next[j]; end; if mins<minx then begin minx:=mins;mi:=i; end; end; procedure maxi(var x:longint;y:longint); inline; begin if y>x then x:=y; end; procedure update(i,ll,rr,k:longint); inline; var mid:longint; begin if ll>rr then exit; if (l[i]=ll)and(r[i]=rr) then begin b[i]:=k;maxi(ma[i],k);exit; end; mid:=(l[i]+r[i])div 2; if bb[i]>-oo-1 then begin bb[i*2]:=bb[i];bb[i*2+1]:=bb[i];ma[i*2]:=bb[i];ma[i*2+1]:=bb[i]; b[i]:=-oo-1;bb[i]:=-oo-1; end; if b[i]>-oo-1 then begin b[i*2]:=b[i];b[i*2+1]:=b[i];maxi(ma[i*2],b[i]);maxi(ma[i*2+1],b[i]); b[i]:=-oo-1; end; update(i*2,ll,min(mid,rr),k);update(i*2+1,max(mid+1,ll),rr,k); ma[i]:=max(ma[i*2],ma[i*2+1]); end; function ask(i,ll,rr:longint):longint; inline; var mid:longint; begin if ll>rr then exit(-oo); if (l[i]=ll)and(r[i]=rr) then exit(ma[i]); if bb[i]>-oo-1 then begin bb[i*2]:=bb[i];bb[i*2+1]:=bb[i];ma[i*2]:=bb[i];ma[i*2+1]:=bb[i]; b[i]:=-oo-1;bb[i]:=-oo-1; end; if b[i]>-oo-1 then begin b[i*2]:=b[i];b[i*2+1]:=b[i];maxi(ma[i*2],b[i]);maxi(ma[i*2+1],b[i]); b[i]:=-oo-1; end; mid:=(l[i]+r[i])div 2; ask:=max(ask(i*2,ll,min(mid,rr)),ask(i*2+1,max(mid+1,ll),rr)); end; procedure work(i:longint); inline; var j,k,ll:longint; begin v[i]:=true; j:=h[i]; ma[1]:=-oo;bb[1]:=-oo;b[1]:=-oo-1; update(1,0,0,0); while j<>0 do begin k:=point[j]; if not v[k] then begin ed:=0; dfs1(k,0,1,w[j]); for ll:=1 to ed do maxi(ans,ask(1,max(0,lc-qd[ll]),rc-qd[ll])+qs[ll]); for ll:=1 to ed do update(1,qd[ll],qd[ll],qs[ll]); end; j:=next[j]; end; j:=h[i]; while j<>0 do begin k:=point[j]; if not v[k] then begin minx:=n+1; tot:=son[k]; dfs2(k,0); work(mi); end; j:=next[j]; end; end; procedure build(i,ll,rr:longint); inline; var mid:longint; begin if ll>rr then exit; l[i]:=ll;r[i]:=rr;b[i]:=-oo-1;ma[i]:=-oo-1; mid:=(ll+rr)>>1; if ll=rr then exit; build(i*2,ll,mid);build(i*2+1,mid+1,rr); end; procedure link(x,y,z:longint); begin inc(e); next[e]:=h[x];point[e]:=y;w[e]:=z;h[x]:=e; end; begin assign(input,'wood.in');reset(input); assign(output,'wood.out');rewrite(output); readln(n,lc,rc); for i:=1 to n-1 do begin readln(x,y,z);link(x,y,z);link(y,x,z); end; ans:=-oo; build(1,0,n); work(1); writeln(ans); close(input);close(output); end.

单调队列关键代码：

procedure deal(i:longint);var j,k,i1,i2,t:longint; begin k:=d[i];j:=p[k];o[i]:=true;t:=0; while k<>0 do begin if not o[j] then begin max:=0;dfs1(i,j,c[k],1); beg:=1;clo:=0;i2:=-1; for i1:=max downto 0 do begin for i2:=i2+1 to r-i1 do if i2<=t then begin while (beg<=clo)and(a[q[clo]]<=a[i2]) do dec(clo); inc(clo);q[clo]:=i2; end else break; while (beg<=clo)and(q[beg]+i1<l) do inc(beg); if (beg<=clo)and(a[q[beg]]+b[i1]>ans) then ans:=a[q[beg]]+b[i1]; end; if max>t then for t:=t+1 to max do a[t]:=-(1<<29); for i1:=1 to max do if b[i1]>a[i1] then a[i1]:=b[i1]; tot:=s[j];min:=maxlongint; dfs2(i,j);go[j]:=best; end; k:=next[k];j:=p[k]; end; k:=d[i];j:=p[k]; while k<>0 do begin if not o[j] and (s[j]>=l) then deal(go[j]); k:=next[k];j:=p[k]; end; end;

可惜考试时被这个单调队列萎到了，盾哥出的题就是恶心

这题ms是wc一道题的简化版