2018年2月7日
LCA - 倍增法去求第几个节点
摘要： You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value assigned t 阅读全文
posted @ 2018-02-07 15:10 楼主好菜啊 阅读(161) 评论(0) 推荐(0) 编辑