Highways POJ 2485【Prim】
来源:互联网 发布:手机 惯性导航算法 编辑:程序博客网 时间:2024/04/19 15:35
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
#include<stdio.h>#include<string.h>#define INF 0x3f3f3f3f#define N 550int n;int i,j;int map[N][N];int a,b;int low[N];bool vis[N];int sum[N];void input(){//memset(map,INF,sizeof(map));for(i=1;i<=n;++i){for(j=1;j<=n;++j){scanf("%d",map[i]+j);}}}void prim(){int pos=1;for(i=1;i<=n;++i)//第一次给low赋值 {low[i]=map[pos][i];}vis[pos]=1; //加入最小生成树集合 for(i=1;i<n;++i)//再找n-1个点 {int min=INF;for(j=1;j<=n;++j){if(!vis[j]&&min>low[j]){min=low[j];pos=j;//把找到的点记录下}}sum[i]=min;vis[pos]=1; for(j=1;j<=n;++j){if(!vis[j]&&low[j]>map[pos][j]){low[j]=map[pos][j];}} }}int main(){int T;scanf("%d",&T);while(T--){scanf("%d",&n);memset(vis,0,sizeof(vis));input();prim();int max=-INF;for(i=1;i<n;++i)if(max<sum[i])max=sum[i];printf("%d\n",max);}return 0;}
0 0
- Highways POJ 2485【Prim】
- poj 2485 Highways ( prim )
- poj 2485 Highways(prim)
- POJ 2485 Highways (kruskal+prim)
- POJ 2485 Highways (MST.Prim)
- POJ 2485 Highways(prim算法)
- poj 2485 highways(prim)
- poj 2485 Highways prim最小生成树
- POJ 2485 Highways (prim最小生成树)
- POJ 2485 Highways(Prim 和 Kruskal)
- POJ 2485 Highways 【最小生成树Prim】
- Poj 1751 Highways(prim)
- Highways POJ 1751 【Prim || Kruscal】
- poj 1751 Highways prim算法
- pku 2485 Highways(prim)
- POJ 2485-Highways 最小生成树Prim算法
- prim 与dijkstra的异同 POJ 2485 Highways
- POJ 2485 Highways(prim 最小生成树)
- light oj 1110 LCS 记录路径
- HDU 5371 Hotaru's problem(Manacher 求一序列三部分回文)
- hadoop远程调试
- System.currentTimeMillis()计算方式与时间的单位转换
- bzoj3585: mex
- Highways POJ 2485【Prim】
- oracle授权时“with admin option”与“with grant option”的区别
- C++ 对象数组
- 我的VIM配置(ubuntu)语法高亮 自动补全
- SQL Server 2008连接字符串写法大全
- Oracle EBS Interface/API(3)--采购订单审批
- UIView中常见的方法总结
- C++笔试总结-面试笔试常考题型(一)指针-引用-宏定义-sizeof
- Tree