Query on a tree V (动态点分治预处理,LCA计算两点距离, 堆维护最短距离)
Query on a tree V
You are given a tree (an acyclic undirected connected graph) with N nodes. The tree nodes are numbered from 1 to N. We define dist(a, b) as the number of edges on the path from nod...
原创
2019-07-11 15:00:43 ·
224 阅读 ·
0 评论