Note -「virtual tree」shorter vrt
Part. 1 Preface没什么 preface。Part. 2 实现具体来说就是把所有关键点按 $\text{dfn}$ 排序,去重,然后求出相邻结点的 $\text{LCA}$,然后加入...
In mathematics you don't understand things, you just get used to them.
In mathematics you don't understand things, you just get used to them.