POJ 2485 Highways 最小生成树 (Kruskal)
来源:互联网 发布:网红阿沁的淘宝店 编辑:程序博客网 时间:2024/05/20 09:27
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.
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.
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
130 990 692990 0 179692 179 0
Sample Output
692题意: 先输入T,有T组数据,再输入有N个点,N行N列 每个数据代表I点到J点的距离,求完成一个 最小生成树种 的 最大边。#include<iostream>#include<cstdio>#include<algorithm>using namespace std;#define q 505int fa[q];int map[q][q];struct node{int x,y,l;}q[q*q/2];int find(int x){return x==fa[x]?x:find(fa[x]);}int cmp(node a,node b){return a.l<b.l;}int main(){int k,t,n,i,j,max1;scanf("%d",&t);while(t--){max1=0;k=0;scanf("%d",&n); for(i=1;i<=n;i++){fa[i]=i;for(j=1;j<=n;j++){ scanf("%d",&map[i][j]);if(i<j) // 优化:去掉重边还有中间的0{k++; //不知道有多少边,这样统计q[k].x=i;q[k].y=j;q[k].l=map[i][j];} }} sort(q+1,q+1+k,cmp); //根据每条边的距离排序for(i=1;i<=k;i++){if(fa[find(q[i].x)]!=fa[find(q[i].y)]) //并查集思想。。{fa[find(q[i].x)]=find(q[i].y);if(q[i].l>max1)max1=q[i].l;}}cout<<max1<<endl;}return 0;}
Kruskal 模板。。
0 0
- poj 2485Highways(最小生成树 Kruskal)
- POJ 2485 Highways 最小生成树 (Kruskal)
- POJ:2485 Highways(最小生成树kruskal算法)
- POJ 2485 Highways (最小生成树 Kruskal算法)
- 【POJ】2485--Highways(最小生成树 --Kruskal)
- POJ 1751 Highways (Kruskal 最小生成树)
- POJ 2485 Highways Kruskal+并查集 最小生成树
- POJ 2485 Highways 最小生成树 Kruskal && Prim
- POJ:1751 Highways(最小生成树kruskal算法)
- Poj --1751 highways (最小生成树,kruskal算法)
- 文章标题 POJ 2485 : Highways(最小生成树--kruskal+并查集)
- 1007. Highways(kruskal最小生成树)
- POJ 2485 Highways (最小生成树)
- poj 2485 Highways (最小生成树)
- POJ 2485 Highways(最小生成树)
- 【POJ】-2485-Highways(最小生成树)
- POJ 2485 Highways(最小生成树)
- POJ 2485Highways(最小生成树)
- 推荐Java程序员阅读的书籍
- app-framework学习-----使用jquery
- OLAP中的父子维度
- myeclipse开启后卡死、building workspace缓慢 问题解决
- 护卫神php套件快速搭建本地IIS网站,及解决80端口被封、动态IP甚至无公网IP
- POJ 2485 Highways 最小生成树 (Kruskal)
- createSQLQuery返回对象
- Linux性能统计 - cat /proc/meminfo
- hdu4628 状态压缩搜索or状态dp
- intellij 左右窗口联动
- hdu 1862 EXCEL排序
- Android使用自带JSONObject解析JSON数据 - jCuckoo的专栏 - 博客频道 - CSDN.NET
- 手动进行Excel数据和MySql数据转换
- JPA 主键生成策略