POJ 2485 Highways【最小生成树最大边,Prime算法】
来源:互联网 发布:陈涌海 知乎 编辑:程序博客网 时间:2024/04/28 11:13
Highways
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 28592 Accepted: 13037
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.
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()); }}
0 0
- POJ 2485 Highways【最小生成树最大边,Prime算法】
- POJ 1751 Highways(最小生成树prime算法)
- POJ 题目2485 Highways(最小生成树最大边)
- POJ 2485 Highways 最小生成树的最大边
- poj 2485 Highways prim最小生成树 基础 球最小生成树中得最大边
- 最小生成树Prim算法 Highways POJ
- POJ 2485-Highways 最小生成树Prim算法
- 初级->图算法->最小生成树 poj 2485 Highways
- POJ 2485 Highways 图论 prim算法 最小生成树
- POJ 2485 Highways 最小生成树 prim算法
- POJ 2485 Highways(最小生成树prim算法)
- POJ:2485 Highways(最小生成树kruskal算法)
- POJ 2485 Highways (最小生成树 Kruskal算法)
- POJ 2485 Highways 两种最小生成树算法
- (kruscal12.3.5)POJ 2485 Highways(使用kruscal来计算最小生成树的最大边)
- Highways 2485(最小生成树的最大边)
- POJ 2485 Highways【最小生成树】
- poj 2485Highways(最小生成树 Kruskal)
- alsa 音频路径的问题:
- ※ Leetcode - Dynamic Programming - 53.Maximum Subarray(最大连续和)+152.Maximum Product Subarray(最大连续积)
- 课堂笔记2016.8.3
- 【杭电1231】最大连续子序列
- dom4j 解析xml
- POJ 2485 Highways【最小生成树最大边,Prime算法】
- (38)操作数组单元 (39)遍历数组 (40)数组游标操作
- 博客相关资源下载 (JAVA,C++,UE4,Unity)
- 断舍离---新生活方式指引
- layer的弹出层的简单的例子
- HDU 1003 Max sum
- eclipse部署web项目至本地的tomcat但在webapps中找不到
- nginx学习
- KVO/KVC的原理讲解及编程指南