Highways
Description
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 Hint
Huge input,scanf is recommended.
Source
POJ Contest,Author:Mathematica@ZSU
|
题意:
给出一个邻接矩阵,输出生成的最小生成树的最大边。
解题思路:
裸的Kruskal算法,每次加边的时候保存增加边的最大值,最后输出最大值即可。开始的时候数组不够大,贡献了一次RE。下面是我的代码。
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define maxn 250010
int p[maxn];
int n;
struct lin
{
int from,to,val;
} arr[maxn];
int cmp(lin a,lin b)
{
return a.val<b.val;
}
int find(int x)
{
return p[x]==x?x:find(p[x]);
}
int kruskal()
{
for(int i=1; i<=n; i++)
p[i]=i;
int ans=-1,cnt=0;
for(int i=0; i<n*n; i++)
{
int x=find(arr[i].from);
int y=find(arr[i].to);
if(x!=y)
{
ans=max(ans,arr[i].val);
cnt++;
p[x]=y;
}
if(cnt==n-1) break;
}
return ans;
}
int main()
{
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int t;
cin>>t;
getchar();
while(t--)
{
getchar();
scanf("%d",&n);
int cur=0;
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
{
arr[cur].from=i;
arr[cur].to=j;
scanf("%d",&arr[cur++].val);
}
sort(arr,arr+n*n,cmp);
printf("%d\n",kruskal());
}
return 0;
}