Highways(最小生成树_prim()求最短路中的最大路径)
来源:互联网 发布:it招聘 编辑:程序博客网 时间:2024/06/07 16:53
Highways
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22867 Accepted: 10540
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
Sample Input
130 990 692990 0 179692 179 0
Sample Output
692
题意:其实就是求最小生成树中的最大路径;
第一行T指有几组测试数据,接下来n是有几个村子,接下来n行是指从1号到n号距离每个村子的距离,比如(0,990,692)指的是一号村子距离一号村子的距离为0,距离二号位990,距离三号为692.
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <iostream>#include <algorithm>using namespace std;#define inf 0x3f3f3fint map[505][505];int dis[505];int vis[505];int n;void prim(){ int i,j,k; int sum=0; int max=-1; int min; memset(vis,0,sizeof(vis)); for(i=1; i<=n; i++) dis[i]=map[1][i]; vis[1]=1; for(i=1; i<n; i++) { min=inf; for(j=1; j<=n; j++) if(!vis[j]&&dis[j]<min) { min=dis[j]; k=j; } vis[k]=1; if(max<min) max=min; for(j=1; j<=n; j++) { if(!vis[j]&&map[k][j]<dis[j]) { dis[j]=map[k][j]; } } } printf("%d\n",max);}int main(){ int T; int i,j,w; scanf("%d",&T); while(T--) { scanf("%d",&n); for(i=1; i<=n; i++) for(j=1; j<=n; j++) { if(i==j) map[i][j]=0; else map[i][j]=inf; } for(i=1; i<=n; i++) for(j=1; j<=n; j++) { scanf("%d",&w); map[i][j]=min(map[i][j],w); } prim(); } return 0;}
0 0
- Highways(最小生成树_prim()求最短路中的最大路径)
- 最小生成树_Prim
- 最小生成树_prim
- 最小生成树_Prim
- poj2485 Highways 最小生成树求最大边
- 最小生成树_prim(加点)
- 【数据结构】最小生成树_Prim
- 最小生成树_Prim.c
- POJ 题目2485 Highways(最小生成树最大边)
- Highways 2485(最小生成树的最大边)
- poj2485 Highways(kruskal求最小生成树)
- poj 1751 Highways (最小生成树+记录路径)
- POJ 1751 Highways (最小生成树+记录路径)
- poj1751 highways 最小生成树记录路径
- Highways(最小生成树)
- Highways(最小生成树 )
- Highways (最小生成树)
- Highways (最小生成树)
- API窗体分割
- 删除MFC单文档默认菜单栏的两种方法
- 又见01背包
- C#使用Find方法
- Spring AOP原理及简单应用
- Highways(最小生成树_prim()求最短路中的最大路径)
- LINQ to JavaScript 源码分析
- Ubuntu安装配置MySQL数据库
- 如何去接触更多客户?
- Aov网络与拓补排序的实现
- 第9周项目6(4)-委派任务
- PAT(A) 1027
- ...和foreach
- C运行时库(C Run-time Library)详解