树形DP
薄层
努力就有收获~
展开
-
HDU-6201 transaction transaction transaction(树形dp)
2017 ACM/ICPC Asia Regional Shenyang Online Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will read a book named "the Man Who Changed China". Of course, Kelukin wouldn'原创 2017-09-10 22:32:40 · 309 阅读 · 0 评论 -
HDU-5647 DZY Loves Connecting(树形dp)
DZY has an unrooted tree consisting of nn nodes labeled from 11 to nn. DZY likes connected sets on the tree. A connected set SS is a set of nodes, such that every two nodes u,vu,v in SS can be connected by a path on the tree, and the path should only cont原创 2017-07-19 23:21:30 · 298 阅读 · 0 评论 -
HDU-6178 Monkeys - 2017 Multi-University Training Contest - Team 10(树形DP)
There is a tree having N vertices. In the tree there are K monkeys (K <= N). A vertex can be occupied by at most one monkey. They want to remove some edges and leave minimum edges, but each monkey must be connected to at least one other monkey through the原创 2017-08-26 11:02:58 · 269 阅读 · 0 评论