POJ 1751 Highways(╬▔皿▔)凸

分你半口奶盖

于 2021-07-29 08:44:08 发布

阅读量232

点赞数 2

本文链接：https://blog.csdn.net/zz_xun/article/details/119187217

版权

题意描述：是建高速公路，求需要修那些路。先求出每个点到其他点的距离。这道题不同的是，首先要找到连通所有地方的最短路径，然后输出最短路径中距离最长的那条路的值再个人觉得Prim更适合这道题，因为最后只需要遍历一次dis数组，输出最大的即可。

解题思路：用一个数组记录路径，一个数组存点，注意已经建好的无需输出，然后最后定义一个变量，使得输出的是dis数组中最大的值

错误分析：找到最短的路但是输出的是这条最短路径中距离最长的一条路的值。

题目

The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They're planning to build some highways so that it will be possible to drive between any pair of towns without leaving the highway system.

Flatopian towns are numbered from 1 to N. Each highway connects exactly two towns. All highways follow straight lines. All highways can be used in both directions. Highways can freely cross each other, but a driver can only switch between highways at a town that is located at the end of both highways.

The Flatopian government wants to minimize the length of the longest highway to be built. However, they want to guarantee that every town is highway-reachable from every other town.

Input

The first line of input is an integer T, which tells how many test cases followed.
The first line of each case is an integer N (3 <= N <= 500), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 65536]) between village i and village j. There is an empty line after each test case.

Output

For each test case, you should output a line contains an integer, which is the length of the longest road to be built such that all the villages are connected, and this value is minimum.

Sample Input
1

3
0 990 692
990 0 179
692 179 0
Sample Output
692

AC代码 🉑

#include<stdio.h>
int main()
{
	int e[510][510],dis[510],book[510];
	int i,j,t,n,u,v,min;
	int inf=999999999;
	scanf("%d",&t);
	while(t--)
	{	
		scanf("%d",&n);
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			{
				scanf("%d",&e[i][j]);		
			}	
		}
		for(i=1;i<=n;i++)
		{
			dis[i]=e[1][i];
			book[i]=0;	
		}	
		book[1]=1;
		for(i=1;i<n;i++)
		{
			min=inf;
			for(j=1;j<=n;j++)
			{
				if(book[j]==0&&dis[j]<min)
				{
					min=dis[j];
					u=j;
				}
			}
			book[u]=1;
			for(v=1;v<=n;v++)
			{
				if(book[v]==0&&dis[v]>e[u][v])
					dis[v]=e[u][v];
			}
		}
		int ans=0;
		for(i=1;i<=n;i++)
		{
			if(ans<dis[i])
				ans=dis[i];
		}
		printf("%d\n",ans);
	}	
}