lml11111的博客

Description 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 relati...

Description 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...

Problem Description 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 conn...

Problem Description ACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗？     Input 每个测试实例首先包括2个整数，N,M.(1...

举个例子来理解 16年沈阳区域赛【树形dp+斜率优化】 题意： 给你n个点，n-1条边的树。每条边有一个权值w。给你一个值p。 1号节点为根节点。求1号点到所有节点的路径中的最小权值  的最大值。 权值计算方法：将这条路可以一次走完，权值是(dis[u]-dis[1])*(dis[u]-dis[1])，也可以分段走完，每经过一个点权值加p,假如经过一个点x,那么权值可以是(dis[u]-...