POJ 2485 Highways 【最小生成树Prim】
来源:互联网 发布:程序员代码竖屏 编辑:程序博客网 时间:2024/04/24 20:51
Highways
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 28397 Accepted: 12942
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
题意是求最小生成树上的最大的连接距离,题中直接给了矩阵,而且Prim算法更新最大的距离比较方便。
#include <cstdio>#include <cstring>#include <algorithm>#define MAXN 1005using namespace std;const int INF = 1e9;bool vis[MAXN];int cost[MAXN][MAXN], mincost[MAXN], n;int prim() { int ans = 0;memset(vis, false, sizeof(vis)); for (int i = 0; i <= n; i++) mincost[i] = INF; mincost[0] = 0; while (true) { int v = -1; for (int u = 0; u < n; u++) { if (!vis[u] && (v == -1 || mincost[v] > mincost[u])) v = u; } if (v == -1) break; vis[v] = true; ans = max(mincost[v], ans); for (int u = 0; u < n; u++) { mincost[u] = min(mincost[u], cost[u][v]); } } return ans;}int main() { int t; scanf("%d", &t); while (t--) { scanf("%d", &n); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { scanf("%d", &cost[i][j]); cost[j][i] = cost[i][j]; } } printf("%d\n", prim()); } 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算法
- mac下安装Homebrew
- 使用canvas做个简单的抠图游戏
- HDU 1521 数学 母函数
- OC-方法、设置器 与 访问器、便利初始化函数 与 便利构造器
- ssrf爬虫扫描小工具ssrf_scan
- POJ 2485 Highways 【最小生成树Prim】
- ZZULI OJ 1898: 985的数字难题
- POJ 2346 DP or打表
- 工作流引擎,持续更新。。。
- ACM 算法 阶段性练习 (比较全面)
- linux高级编程二基础知识
- 属性动画
- 【zzulioj 1899 985的最大和难题】
- poj 2049 Finding Nemo