树形dp
破晓aa
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #527 (Div. 3) F. Tree with Maximum Cost (树形dp)
You are given a tree consisting exactly of原创 2018-12-20 10:59:40 · 245 阅读 · 0 评论 -
Information Disturbing HDU - 3586(树形dp + 二分查找)
In the battlefield , an effective way to defeat enemies is to break their communication system. The information department told you that there are n enemy soldiers and their network which have n-1 co...原创 2018-12-18 11:10:19 · 153 阅读 · 0 评论 -
Computer HDU - 2196 (树形dp)
A school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Ma...原创 2018-12-18 11:31:00 · 173 阅读 · 0 评论 -
Educational Codeforces Round 58 D. GCD Countin(分解质因子+树形dp)
题目链接题意:给出一棵树,每个节点有权值,g(x, y)代表x节点到y节点路径上的最大公因子,dist(x, y)代表x到y的距离,求在g(x, y) > 1的条件下,dist(x, y)的最大值思路:首先要明白,要使gcd(x, y) > 1,只需要二者有公共质因子就行了,所以必须要分解质因子了,而且可以知道每个数的质因子不超过7个(因为前七个素数之积已经超过1e5了)...原创 2019-01-14 10:36:37 · 128 阅读 · 0 评论