POJ 2485 Highways【最小生成树最大边,Prime算法】
2016-08-08 15:21
323 查看
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
Sample Output
Hint
Huge input,scanf is recommended.
Source
POJ Contest,Author:Mathematica@ZSU
原题链接:http://poj.org/problem?id=2485
题意:求最小生成树的最大边。
还是最小生成树,Prime算法和Kruskal算法都可以,但这题输入的是邻接矩阵,Prime算法好一点。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 28592 | Accepted: 13037 |
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
原题链接:http://poj.org/problem?id=2485
题意:求最小生成树的最大边。
还是最小生成树,Prime算法和Kruskal算法都可以,但这题输入的是邻接矩阵,Prime算法好一点。
AC代码:
#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int INF=0x3f3f3f3f; int a[505][505]; int dis[505]; bool vis[505]; int n; int Prime() { for(int i=0;i<n;i++) { vis[i]=false; dis[i]=a[0][i]; } vis[0]=true; dis[0]=0; int ans=0; for(int i=1;i<n;i++) { int p=-1; int minn=INF; for(int j=0;j<n;j++) { if(!vis[j]&&dis[j]<minn) minn=dis[p=j]; } vis[p]=true; if(minn>ans) ans=minn; for(int j=0;j<n;j++) { if(!vis[j]&&dis[j]>a[p][j]) dis[j]=a[p][j]; } } return ans; } int main() { int T; cin>>T; while(T--) { scanf("%d",&n); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) scanf("%d",&a[i][j]); } printf("%d\n",Prime()); } }
相关文章推荐
- 初级->图算法->最小生成树 poj 2485 Highways
- poj-2485-Highways-最小生成树的最大权边
- POJ 2485 Highways 最小生成树的最大边
- POJ 2485 Highways【最小生成树最大权——简单模板】
- poj 2485 Highways 求最小生成树中的最大边
- 小白算法练习 最小生成树 POJ 2485 Highways
- poj 2485 Highways(最小生成树中求最大权值)
- poj 2485 Highways(最小生成树,基础,最大边权)
- (kruscal12.3.5)POJ 2485 Highways(使用kruscal来计算最小生成树的最大边)
- POJ 2485 Highways【最小生成树最大权——简单模板】
- poj 2485 Highways prim最小生成树 基础 球最小生成树中得最大边
- POJ 2485 Highways 两种最小生成树算法
- POJ 2485 Highways(最小生成树,树的最大权值边)
- POJ 1751 Highways(最小生成树prime算法)
- POJ 题目2485 Highways(最小生成树最大边)
- poj 2485 Highways 最小生成树
- poj 2485 Highways (最小生成树)
- poj 2485 Highways (最小生成树)
- poj 1251 1258 2421 2485(最小生成树prime)
- poj 2395 Out of Hay、2485 Highways(求最小生成树的最长边)