把前向星那一段的
```cpp
for(rg int i=head[l];i;i=h[i].next){
int d=h[i].next;
if(top[d]==top[l]){
l=d;
break;
}
}
```
改成
```
for(rg int i=head[l];i;i=h[i].next){
int d=h[i].node;
if(top[d]==top[l]){
l=d;
break;
}
}
```
没用QAQ
by Imakf @ 2018-12-03 18:42:55
@[Imakf](/space/show?uid=47863) 在dfs2的时候就处理处每个点到ta所在的链的顶端这段路径之中的最小值,最后q组询问直接调用不就行了= = ?
by Juan_feng @ 2018-12-03 18:47:24
@[Juan_feng](/space/show?uid=66965) ……确实挺有道理,谢谢dalao,明天再改吧……写了186行的估计要抹掉大半
by Imakf @ 2018-12-03 18:49:17
树剖维护边权写起来不会很奇怪吗
by little_gift @ 2018-12-03 18:50:16
@[little_gift](/space/show?uid=22132) 是鸭
by Imakf @ 2018-12-03 18:54:34
数剖。。
by da32s1da @ 2018-12-03 18:57:20
@[little_gift](/space/show?uid=22132) 不然你怎么维护
如果的确需要的话
by memset0 @ 2018-12-03 18:57:49
@[Juan_feng](/space/show?uid=66965) 这样不会漏掉几条边吗?
by Imakf @ 2018-12-03 18:58:44
@[Juan_feng](/space/show?uid=66965) %%%
by yzhang @ 2018-12-03 18:58:52
@[little_gift](/space/show?uid=22132) 边权树剖为啥奇怪呀QAQ?
by Juan_feng @ 2018-12-03 18:58:54