树形dp
_ispecter_
这个作者很懒,什么都没留下…
展开
-
Tree Cutting (Easy Version)
You are given an undirected tree of n vertices.Some vertices are colored blue, some are colored red and some are uncolored. It is guaranteed that the tree contains at least one red vertex and at leas...原创 2019-08-13 16:28:33 · 162 阅读 · 0 评论 -
Balancing Act poj-1655
Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1…N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of...原创 2019-08-16 09:51:27 · 180 阅读 · 0 评论 -
Tree with Maximum Cost CodeForces - 1092F
树形dp原创 2019-08-31 10:02:19 · 196 阅读 · 0 评论