contestants专题

poj 3140 Contestants Division(树形dp? dfs计数+枚举)

本文出自   http://blog.csdn.net/shuangde800 -------------------------------------------------------------------------------------- 题目链接: poj-3140 题目    给n个节点的带权树,删掉其中一边,就会变成两颗子树,

Contestants Division(树形dp+删边)

题目:Contestants Division In the new ACM-ICPC Regional Contest, a special monitoring and submitting system will be set up, and students will be able to compete at their own universities. However there’