HDU 6060 RXD and dividing (最小斯坦纳树)
RXD and dividing题目链接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 divide
原创
2017-08-07 11:14:54 ·
2264 阅读 ·
0 评论