poj 2485 Highways prim最小生成树
来源:互联网 发布:sql server 2017 安装 编辑:程序博客网 时间:2024/04/20 21:04
Highways
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20820 Accepted: 9628
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
Hint
Huge input,scanf is recommended.
#include<stdio.h>#include<math.h>#include<string.h>#define INF 0x3f3f3f3f#define N 550int map[N][N],low[N],vis[N],n;int prim(){ int i ,j,pos,min ,sum = 0 ; memset(vis,0,sizeof(vis)); pos = 1 ; vis[1]=1; for(i = 2 ; i <= n ; i++) low[i]=map[pos][i]; for(i = 1; i < n ; i++) { min=INF; for(j = 1 ;j <= n ; j++) if(vis[j]==0&&min>low[j]) { min = low[j]; pos = j; } vis[pos]=1; if(sum < min) sum = min ; for(j = 1 ; j <= n ; j++) if(vis[j]==0&&low[j]>map[pos][j]) low[j]=map[pos][j]; } return sum;}int main(){int t;scanf("%d",&t);while(t--){ memset(map,INF,sizeof(map)); scanf("%d",&n); for(int i = 1 ; i <= n ; i ++) for(int j = 1 ; j <= n ; j++) { scanf("%d",&map[i][j]); } int ans=prim(); printf("%d\n",ans);}return 0;}
0 0
- poj 2485 Highways prim最小生成树
- POJ 2485 Highways (prim最小生成树)
- POJ 2485 Highways 【最小生成树Prim】
- POJ 1751 Highways(最小生成树prim)
- poj 1751 Highways 最小生成树 prim
- 最小生成树Prim算法 Highways POJ
- POJ 2485-Highways 最小生成树Prim算法
- POJ 2485 Highways(prim 最小生成树)
- POJ 2485 Highways 图论 prim算法 最小生成树
- POJ 2485 Highways(最小生成树 Prim)
- poj 2485 Highways(kruscal or prim最小生成树)
- POJ 2485:Highways:典型prim最小生成树(2)
- poj 2485 Highways(prim求最小生成树)
- POJ 2485:Highways(最小生成树&&prim)
- poj 2485 Highways(最小生成树,prim)
- poj 2485 Highways(最小生成树 Prim)
- POJ 2485-Highways(最小生成树prim)
- POJ 2485 Highways 最小生成树 prim算法
- []符号重载
- Oracle学习网址
- C++临时对象的生命周期
- 感恩--学会分享
- 函数重载
- poj 2485 Highways prim最小生成树
- protobuf 的安装
- 调试 动态分析技术
- 基于直方图的图像二值化算法实现
- 错过(愿与君共勉)
- LeetCode Evaluate Reverse Polish Notation(用栈来计算后缀表达式)
- struts2之Action获取web资源
- UIKit Dynamics and Motion Effects(一)
- 指针赋值与空间分配问题