邵光亮的博客

DescriptionBuilding and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that there is only one route from a village to a v...

题目描述X 国有nn座城市，n − 1n−1条长度为11的道路，每条道路连接两座城市，且任意两座城市都能通过若干条道路相互到达，显然，城市和道路形成了一棵树。X 国国王决定将kk座城市钦定为 X 国的核心城市，这kk座城市需满足以下两个条件：这kk座城市可以通过道路，在不经过其他城市的情况下两两相互到达。 定义某个非核心城市与这kk座核心城市的距离为，这座...

DescriptionAfter hearing about the epidemic of obesity in the USA, Farmer John wants his cows to get more exercise, so he has committed to create a bovine marathon for his cows to run. The marathon...

Problem DescriptionIn the Data structure class of HEU, the teacher asks one problem: How to find the longest path of one tree and the number of such longest path?InputThere are several test cas...