dp:树形dp
文章平均质量分 90
ProLightsfxjh
这个作者很懒,什么都没留下…
展开
-
UVa 12186 Another Crisis dp:树上dp
A couple of years ago, a new world wide crisis started, leaving many people with economical problems.Some workers of a particular company are trying to ask for an increase in their salaries.The company has a strict hierarchy, in which each employee has e原创 2016-03-01 18:37:22 · 1023 阅读 · 0 评论 -
UVa 1220 Party at Hali-Bula dp:树的最大独立集
Dear Contestant,I'm going to have a party at my villa at Hali-Bula to celebrate my retirement from BCM. I wish I could invite all my co-workers, but imagine how an employee can enjoy a party when he finds his boss among the guests! So, I decide not to inv原创 2016-03-02 23:31:07 · 1363 阅读 · 0 评论 -
UVa 1218 Perfect Service dp:树上dp && 状态转移方程的优化
A network is composed of N computers connected by N - 1 communication links such that any two computers can be communicated via a unique route. Two computers are said to be adjacent if there is a communication link between them. The neighbors of a computer原创 2016-03-04 16:04:54 · 965 阅读 · 0 评论 -
ZOJ - 3231 Apple Transportation 树形dp
题意:有一颗n节点的苹果树,每个节点上有一定数量的苹果ai,树上有一些松鼠,他们想让苹果平均分配,即每个节点的方差最小。它们可以任意地将苹果在节点之间移动,每移动一个苹果所花费的代价是移动的路程。求最小的总代价。树形dp方差最小其实就是等价于 有 sigma{ai} mod n个节点上有 sigma{ai} / n + 1个苹果,其他都有 sigma{ai} / n 个。f[i][j]表示在节点i代表的子树中有j个节点上有 sigma{ai} / n + 1个苹果,其他的为sigma{ai} / n原创 2017-04-08 20:45:29 · 902 阅读 · 0 评论