PKU/POJ 2054 Color a Tree

关于树的着色.

要求从根节点出发, 遍历整棵树, 要求代价最小. 访问每个节点的代价V[i] = F[i] * C[i], C[i]为已知的值, F[i]则为访问该节点的时间. 每一步只能从已访问的节点拓展.

承认, 这个问题晕了我好一会儿... 本题的解法还是挺有意思的 (我指我想到的, 或许不止一种方法) , 我也就不说了, 爱动脑经的朋友不妨玩一玩.

转载于:https://www.cnblogs.com/lotus3x/archive/2009/03/27/1422796.html

PKU/POJ 2054 Color a Tree相关推荐

POJ 2054 Color a Tree (贪心)
$ POJ~2054~Color~a~Tree $ $ solution: $ 我们先从题中抽取信息,因为每个点的费用和染色的次数有关,所以我们可以很自然的想到先给权值大的节点染色.但是题目还说每个节 ...
POJ 2054 Color a Tree解题报告
题干 Bob is very interested in the data structure of a tree. A tree is a directed graph in which a spe ...
POJ 2054 Color a Tree
贪心.... Color a Tree Time Limit: 1000MS Memory Limit: 30000K Total Submissions: ...
HDU 6241 Color a Tree
Color a Tree 题目大意:一棵树,根为1.某些点有一些限制.限制A: 该$x_i$点子树染色点至少$y_i$个. 限制B: 该$x_i$点子树外染色至少$y_i$个.求最少染色点数. 首先是 ...
poj 3013 Big Christmas Tree（最短路变形）
传送门:POJ 3013 Big Christmas Tree 描述: Big Christmas Tree Time Limit: 3000MS Memory Limit: 131072K To ...
poj 2777Count Color
这道题,做的太悲催了,开始想到每个节点的涂色情况用数组来存,1代表有,0代表没有,提交上去果断RE了好几次,原因是here A, B, C are integers, and A may be lar ...
【POJ - 2486】Apple Tree （树形背包，dp）
题干: Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There ...
【POJ - 3321】 Apple Tree（dfs序 + 线段树维护或 dfs序 + 树状数组维护）
题干: There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the t ...
POJ 1046 Color Me Less(浅水)
一.Description A color reduction is a mapping from a set of discrete colors to a smaller one. The sol ...

PKU/POJ 2054 Color a Tree

PKU/POJ 2054 Color a Tree相关推荐

最新文章

热门文章