HDU 6060 RXD and dividing （最小斯坦纳树）

RXD and dividing 题目连接php Problem Description RXD has a tree T, with the size of n. Each edge has a cost. Define f(S) as the the cost of the minimal Steiner Tree of the set S on tree T. he wants to div

>>阅读原文<<