不二君

题目链接 Description There areNcities in a country, and there is one and only one simple path between each pair of cities. A merchant has chosen some paths and wants to earn as much money as possible ...

题目链接 You are given a tree withNnodes. The tree nodes are numbered from1toN. Each node has an integer weight. We will ask you to perform the following operation: u v k: ask for the kth minimum...