线段树
ZJiaQ1994
这个作者很懒,什么都没留下…
展开
-
2015多校第一场1006 hdu 5293 Tree chain problem
题意:给定一棵树,然后在给定一些链,链放在树上某条路径上,每条链有价值,要求取链,并且所取的链不能相交,使得取得的链的总价值最大。 做法:树上做动态规划,开个dp[i]表示第i个点为根的子树里面的取链最大价值,sum[i]表示i的儿子节点的dp值得和。考虑取一条链时,把一条链的路径上的所有sum[i]-dp[i]加起来(lca那点只需把sum[i]加进去就好了)再加上这条链的价值,这样做的目的是原创 2015-07-29 17:49:12 · 420 阅读 · 0 评论 -
Codeforces 573D Bear and Cavalry
Would you want to fight against bears riding horses? Me neither. Limak is a grizzly bear. He is general of the dreadful army of Bearland. The most important part of an army is cavalry of course.原创 2015-09-18 20:07:40 · 775 阅读 · 0 评论