POJ 2485 Highways(最短路)
来源:互联网 发布:大疆 知乎 编辑:程序博客网 时间:2024/06/07 10:52
Highways
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uAppoint description:
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<string.h>#include<stdlib.h>#define N 1005#define INF 0x7fffffffint map[N][N],v[N];int num[N];int n;void prime(){ int s = 0; int i,j; int max = 0; memset(v,0,sizeof(v)); for(i=0;i<=n;i++) { num[i] = INF; } for(i=0;i<n;i++) { num[i] = map[s][i]; } num[s] = 0; for(i=0;i<n;i++) { int min = INF,k; for(j=0;j<n;j++) { if(v[j] == 0 && num[j]<min) { min = num[j]; k = j; } } if(min == INF) { break; } if(max<min) { max = min; } v[k] = 1; for(j=0;j<n;j++) { if(v[j] == 0 && num[j]>map[j][k]) { num[j] = map[j][k]; } } } printf("%d\n",max);}int main(){ int i,j; int T; scanf("%d",&T); while(T--) { scanf("%d",&n); for(i=0;i<n;i++) { for(j=0;j<n;j++) { scanf("%d",&map[i][j]); } } prime(); } return 0;}
0 0
- POJ 2485 Highways(最短路)
- poj 2485 Highways(Kruskal!)
- poj 2485 Highways(Kruskal)
- POJ-2485-Highways(kruskal)
- poj 2485 Highways(MST)
- poj poj 2485 Highways
- poj 1860(最短路)
- poj 1125(最短路)
- POJ 1125(最短路)
- POJ-1860(最短路)
- POJ 3628(最短路)
- POJ 2485 Highways(最小生成树,树的最大权值边)
- poj-2485-Highways-最小生成树的最大权边
- POJ 2485 Highways(prim算法)
- poj 2485Highways (求最长路)
- POJ 2485 Highways && HDU1102(20/200)
- POJ 2485 Highways (最小生成树)
- poj 2485 Highways (最小生成树)
- HDU 5015 233 Matrix
- 软工概述
- C++和JAVA的区别
- WeakHashMap 笔记
- C语言,你真的弄懂了么?
- POJ 2485 Highways(最短路)
- Delphi将字符串写入text文档
- STL源码剖析一——STL概论
- CGI 搜集资料(本网站已经收藏,非原创,以备遗忘,均未测试,有待测试验证)。(感谢所有提供者)
- struts2 实现输入校验之validate方法
- supervise程序进行程序管理监控
- 互联网广告的盈利模式
- linux 的进程调度原理
- Python3的变化