摘要：
Query on a tree III You are given a node labeled rooted tree with n nodes. Define the query (x, k): Find the node whose label is k th largest in the s 阅读全文
摘要：
Query on a tree II 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 integ 阅读全文