动态规划-树形DP
文章平均质量分 87
snowy_smile
终于在ICPC World Final里拿到了气球!
再努力一点吧,坚持下去吧,梦想是会实现的! 人生会有低谷,但我更相信,未来也会有更多梦想能够实现~
展开
-
【BestCoder Round 65D】【树形DP 容斥思想】ZYB's Tree 求距离每个节点距离不超过k的节点数
ZYB's Tree Accepts: 77 Submissions: 513 Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)问题描述ZYBZYB有一颗NN个节点的树,现在他希望你对于每一个点,求出离每个点距离不超过KK的点原创 2015-12-08 09:11:32 · 1811 阅读 · 0 评论 -
【HDU5647 BestCoder Round 76 (div1)B】【树形DP】DZY Loves Connecting 一棵树的所有生成子树的大小乘积
DZY Loves Connecting Accepts: 16 Submissions: 169 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述DZY有一棵nn个结点的无根树,结点按照1\sim n1∼n标号。原创 2016-03-20 09:46:17 · 1032 阅读 · 0 评论 -
【Codeforces Round 263 (Div 2)D】【树形DP】Appleman and Tree 树上割k个黑点为k块的方案数
Appleman and Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAppleman has a tree with n vertices. Some原创 2016-03-21 15:17:57 · 726 阅读 · 0 评论 -
【ZOJ3949 The 17th Zhejiang University Programming Contest B】【树形DP】Edge to the Root 树上加一边 根距离之和尽可能小
Edge to the RootTime Limit: 1 Second Memory Limit: 131072 KBGiven a tree with n vertices, we want to add an edge between vertex 1 and vertex x, so that the sum of d(1, v) for all vertices原创 2017-04-12 17:03:58 · 1121 阅读 · 0 评论 -
【ZOJ3951 The 17th Zhejiang University Programming Contest D】【树形DP 合并思想 复杂度计算】Independent Set 构造树使得不同
Independent SetTime Limit: 1 Second Memory Limit: 65536 KB Special JudgeChiaki has a positive integer m and she would like to construct a tree with at most 15 vertices in such a mann原创 2017-04-12 23:06:33 · 933 阅读 · 0 评论