树形dp
文章平均质量分 80
闻道-问道
这个作者很懒,什么都没留下…
展开
-
Anniversary party (树形dp)
There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor relation forms a tr原创 2017-11-14 23:59:21 · 241 阅读 · 0 评论 -
Who killed Cock Robin(树形dp)
Who killed Cock Robin?I, said the Sparrow, With my bow and arrow,I killed Cock Robin.Who saw him die?I, said the Fly.With my little eye,I saw him die.Who caught his blood?原创 2018-04-22 20:47:23 · 335 阅读 · 0 评论 -
#1055 : 刷油漆(树形dp)
描述上回说到,小Ho有着一棵灰常好玩的树玩具!这棵树玩具是由N个小球和N-1根木棍拼凑而成,这N个小球都被小Ho标上了不同的数字,并且这些数字都是处于1..N的范围之内,每根木棍都连接着两个不同的小球,并且保证任意两个小球间都不存在两条不同的路径可以互相到达。没错,这次说的还是这棵树玩具的故事!小Ho的树玩具的质量似乎不是很好,短短玩了几个星期,便掉漆了!“简直是一场噩梦!”小Ho拿着树玩具眼含热...原创 2018-03-13 23:01:07 · 193 阅读 · 0 评论 -
Bribing FIPA (树形dp)
There is going to be a voting at FIPA (Fédération Internationale de Programmation Association) to determine the host of the next IPWC (International Programming World Cup). Benjamin Bennett, the deleg原创 2017-11-23 20:11:54 · 319 阅读 · 0 评论 -
日记(周中+树形dp小总结)
这几天看了dp中的树形dp的部分,并且做了几道题。 一般的dp是在线性结构中,在树形结构中的dp是比线性结构中dp效率高的,而在树形结构是很有利于做递归的所以树形dp很多都是递归来实现。 一般的树形dp中的递归有两种(目前见过两种),1先递归子节点,再利用子节点信息更新本结点信息。2先更新本结点信息,再递归子节点。 题型也是不少,我也见识了不少了。1 树的原创 2017-11-16 22:40:50 · 221 阅读 · 0 评论 -
Tree Cutting (树形dp+树的重心变形)
After Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 <= N <= 10,000) barns at an incredible cost, he sued Bessie to mitigate his losses.Bessie, feeling vin原创 2017-11-16 22:28:55 · 1461 阅读 · 0 评论 -
Starship Troopers (树形dp+背包)
You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each roo原创 2017-11-16 21:46:09 · 327 阅读 · 0 评论 -
Balancing Act (树形dp+树的重心)
Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of the原创 2017-11-16 21:23:35 · 334 阅读 · 0 评论 -
Computer (树形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.原创 2017-11-16 21:09:54 · 601 阅读 · 0 评论 -
Rebuilding Roads (树形dp)
The cows have reconstructed Farmer John's farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthquake last May. The cows didn't have time to rebuild any extra roads, so now there原创 2017-11-16 00:08:13 · 287 阅读 · 0 评论 -
Godfather (树形dp,树的重心)
Last years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arrest the mafia leaders.Unfortunately, the structure原创 2017-11-15 23:51:36 · 452 阅读 · 0 评论 -
Apple Tree (树形dp+背包)
Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip at one node. S原创 2017-11-19 23:58:37 · 547 阅读 · 0 评论 -
Choosing Capital for Treeland (树形dp)
The country Treeland consists of n cities, some pairs of them are connected withunidirectional roads. Overall there are n - 1 roads in the country. We know that if we don't take the direction of t原创 2017-11-19 23:52:17 · 476 阅读 · 0 评论 -
The more, The Better (树形dp+背包)
ACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因,有些城堡不能直接攻克,要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗?Input每个测试实例首先包括2个整数,N,M.(1 = 0。当N = 0, M = 0输入结束。Ou原创 2017-11-19 23:35:20 · 319 阅读 · 0 评论 -
Information Disturbing (树形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原创 2017-11-19 23:12:37 · 526 阅读 · 0 评论 -
Contestants Division (树形dp)
In the new ACM-ICPC Regional Contest, a special monitoring and submitting system will be set up, and students will be able to compete at their own universities. However there’s one problem. Due to the原创 2017-11-19 22:59:09 · 386 阅读 · 0 评论 -
Optimal Cut (树形dp+记忆化)
A cut of a binary tree is a set of tree nodes such as for each possible path from the root node to anyleaf node, just one node in the cut belongs to the path. In a weighted binary tree, one can comput...原创 2018-06-12 10:41:11 · 459 阅读 · 0 评论