2012年7月10日

SPOJ 913. Query on a tree II
摘要： SPOJ Problem Set (classical)SPOJ 913. Query on a tree IIProblem code: QTREE2You are given a tree (an undirected acyclic connected graph) withNnodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value assigned to it, representing its length.We will ask you to perfrom some instructions o 阅读全文
posted @ 2012-07-10 12:57 Fatedayt 阅读(735) 评论(0) 推荐(0)

导航