Highways
来源:互联网 发布:虚拟软件下载 编辑:程序博客网 时间:2024/05/21 19:36
Description
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 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
Sample Input
130 990 692990 0 179692 179 0
Sample Output
692
Hint
我认为这应该是最简单的最小生成树了吧 我是刚开始学习最小生成树 自我认为其中对并查集的理解尤为重要 在没有做最小生成树题目之前 在书上我了解了一下Kruskal 算法,然后又在网上百度百科上借用上面的图深入理解Kruskal 算法 再看代码就没有那么难懂了 啊哈哈哈哈~~~~~
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define P 550
int p[600];
struct node
{
int a,b,len;
}s[P*P];
int cmp(struct node w,struct node m)
{
return w.len<m.len;
}
int find(int x)
{
if(x==p[x])
return x;
else
return find(p[x]);
}
int main()
{
int t,i,j,a1,a2,n,k;
scanf("%d",&t);
while(t--)
{
k=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d",&s[k].len);
s[k].a=i;
s[k].b=j;
k++;
}
}
sort(s,s+k,cmp);///给边排序
for(i=1;i<=n;i++)///并查集里面用的数组初始化
p[i]=i;
int min_=0;
for(i=0;i<k;i++)
{
a1=find(s[i].a);
a2=find(s[i].b);
if(a1!=a2)///不在一个集合中,<a1 a2为寻找的最终的根节点>
{
if(s[i].len>min_)
min_=s[i].len;
p[a2]=a1;///就把 以a2为根节点的树和 以a1为根节点所在的树合并
}
}
printf("%d\n",min_);
}
return 0;
}
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- Highways
- highways
- Qt5.x windows中文乱码问题的解决方法(两种乱码问题)
- poj 3264 & poj 3468(线段树)
- 例题4.2 好看的一笔画 LA3263
- CoreGraphics对UIImage图片裁剪
- Docker基本基础知识了解
- Highways
- HDU 5391 Zball in Tina Town(数论——威尔逊定理)——BestCoder Round #51(div.2)
- 刀哥多线程同步任务作用gcd-07-sync_task
- Oracle数据库表被锁
- 技术与经济之六:现代化的陷阱
- 设计模式--浅谈
- HDU 1213 How Many Tables
- 去哪网实习总结:定时发送邮件(JavaWeb)
- 模板函数的名称修饰