随笔分类 -  数据结构--树状数组

CF293E Close Vertices 点分治+单调队列+树状数组
摘要：E. Close Vertices You've got a weighted tree, consisting of n vertices. Each edge has a non negative weight. The length of the path between any two ve 阅读全文
posted @ 2018-10-01 17:50 南城ㄱ 阅读(311) 评论(0) 推荐(0)