摘要：
You are given a tree with n nodes. The weight of the i-th node is wi. Given a positive integer m, now you need to judge that for every integer i in [1 阅读全文
posted @ 2019-05-03 17:37
WAKBGAN
阅读(198)
评论(0)
推荐(0)
摘要：
Description Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and 阅读全文
posted @ 2019-05-03 17:23
WAKBGAN
阅读(206)
评论(0)
推荐(0)
摘要：
点分治 讲解 点分治是一种树上分治思想 可以用更高的效率解决树上路径问题 以poj 1741 tree 为例子 阅读全文
posted @ 2019-05-03 17:20
WAKBGAN
阅读(164)
评论(0)
推荐(0)
浙公网安备 33010602011771号