HDU6060 RXD and dividing
HDU6060 RXD and dividing求树的子节点个数
描述
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 divide 2,3,
原创
2017-08-02 11:58:50 ·
527 阅读 ·
0 评论