摘要: 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 @ 2016-08-31 20:17 水郁 阅读(363) 评论(0) 推荐(0) 编辑
……