HDU:6060 RXD and dividing (DFS)
RXD has a tree TT, with the size of nn. Each edge has a cost. Define f(S)f(S) as the the cost of the minimal Steiner Tree of the set SS on tree TT. he wants to divide 2,3,4,5,6,…n2,3,4,5,6,…n into kk ...
原创
2018-04-19 21:46:59 ·
156 阅读 ·
0 评论