hdu6187 最大生成树
Destroy WallsProblem DescriptionYou are given a rooted tree of N nodes, labeled from 1 to N. To the ith node a non-negative value ai is assigned.An ordered pair of nodes (u,v) is said to be weak if(1) u is an ancestor of v (Note: In this problem a node
原创
2020-10-21 00:27:16 ·
199 阅读 ·
0 评论
关注
分享
扫一扫