某某某的博客

Description When FJ’s friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of whic

Description Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveni

Description As more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW. The routine

解题思路 此题很明显是一个求最小生成树的问题，关键在于如果处理图上边的权值。因为我从七点出发，最终还要沿原路返回起点，所以树上的边皆走过两次。因为每走过一条边都要经过由该边相连的两邻接点，所以最终的权值还要加上两邻接点的权值。一开始我很疑惑点和边同样也要遍历两次为什么不需要乘2。后来发现我们在计算每一条边时都加上了邻接点的权值，所以实际上所有的分支结点都算了两次。通过模拟我们也可以知道在遍历过程