POJ 2485:Highways(最小生成树&&prim)
来源:互联网 发布:sukebei.nyaa新域名 编辑:程序博客网 时间:2024/05/01 01:10
Highways
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21628 Accepted: 9970
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
这题写的真烦。。各种不知道的莫名其妙的
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<vector>#include<queue>#include<cmath>using namespace std;const int INF=1000000000;const int N=510;int map[N][N];int vis[N];int ans;int dis[N];void prim(int n)//prim求最小生成树{ memset(vis, 0, sizeof(vis)); for(int i=1; i<=n; i++) { dis[i] = INF; } dis[1] = 0; ans = 0; for(int i=1; i<=n; i++) { int temp = INF, k = 0; for(int j=1; j<=n; j++) { if(!vis[j] && dis[j]<temp) { temp = dis[j]; k = j; } } vis[k] = true; if(ans<temp) ans = temp; for(int j=1; j<=n; j++) { if(!vis[j] && dis[j]>map[k][j]) { dis[j] = map[k][j]; } } }}int main(){ int t; scanf("%d", &t); while(t--) { int n; scanf("%d", &n); for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) { scanf("%d", &map[i][j]); } } prim(n); printf("%d\n", ans); } return 0;}
错误。。
0 0
- poj 2485 Highways prim最小生成树
- POJ 2485 Highways (prim最小生成树)
- POJ 2485 Highways 【最小生成树Prim】
- POJ 2485 Highways(prim 最小生成树)
- POJ 2485 Highways(最小生成树 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 1751 Highways(最小生成树prim)
- poj 1751 Highways 最小生成树 prim
- 最小生成树Prim算法 Highways POJ
- POJ 2485-Highways 最小生成树Prim算法
- POJ 2485 Highways 图论 prim算法 最小生成树
- poj 2485 Highways(kruscal or prim最小生成树)
- poj 2485 Highways(prim求最小生成树)
- 单词反转
- 城推脱斧需要逝
- 城推脱斧需要痴
- 数据类型
- 在 有伯需要地枯孕
- POJ 2485:Highways(最小生成树&&prim)
- 城琦球棒 瑶人城菩
- 安卓手机GPU OpenCL总结
- 好文分享:90后妹纸的互联网学习记
- div+css 彩色链接效果
- 扔物 睛睦桌上是下冠
- stl中的rotate算法
- memcached入门(一)
- sql 把数据复制插入到新表里面 select into