Highways_poj2485_最小生成树
来源:互联网 发布:kms10激活软件是什么 编辑:程序博客网 时间:2024/06/05 11:20
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.
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.
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
1
3
0 990 692
990 0 179
692 179 0
Sample Output
692
Hint
Huge input,scanf is recommended.
Source
POJ Contest,Author:Mathematica@ZSU
思路:
水水水,求最小生成树中的最长边,kurskal并查集优化+邻接表,好像也快不到哪里去
代码/pas
type edge=record x,y,w:longint; end;var a,b,n,i,k,gg:longint; f,v:array[0..501]of longint; e:array[0..260000]of edge; max:longint;procedure qsort(l,r:longint);var i,j,key:longint; temp:edge;begin if l>=r then exit; i:=l; j:=r; key:=e[l+random(r-l+1)].w; repeat while (e[i].w<key) do inc(i); while (e[j].w>key) do dec(j); if i<=j then begin temp:=e[i]; e[i]:=e[j]; e[j]:=temp; i:=i+1; j:=j-1; end; until i>j; qsort(l,j); qsort(i,r);end;function find(x:longint):longint;var y,w,root:longint;begin y:=x; while f[y]<>0 do y:=f[y]; root:=y; y:=x; while f[y]<>0 do begin w:=f[y]; f[y]:=root; y:=w; end; find:=root;end;procedure union(x,y:longint);begin if find(x)<>find(y) then f[x]:=y;end;procedure init;var i,j:Longint;begin readln(n); for i:=1 to n do for j:=1 to n do with e[(i-1)*n+j] do begin read(w); x:=i; y:=j; end; for i:=1 to n do v[i]:=i; fillchar(f,sizeof(f),0);end;begin readln(gg); while gg>0 do begin dec(gg); init; qsort(1,n*n); k:=0; max:=0; for i:=1 to n*n-1 do if k=n then break else begin a:=find(e[i].x); b:=find(e[i].y); if a<>b then begin if e[i].w>max then max:=e[i].w; union(a,b); k:=k+1; end; end; writeln(max); end;end.
- Highways_poj2485_最小生成树
- 最小比例 最小生成树
- 最小生成树&&次最小生成树
- 最小生成生成树计数
- 树+最小生成树
- 最小生成树
- 最小生成树 MST
- 最小生成树Kruskal
- kruskal 最小生成树
- 最小生成树
- 最小生成树
- 最小生成树
- 最小生成树
- 最小生成树 MST
- 最小生成树问题
- 最小生成树
- 最小生成树
- 最小生成树
- SharedPreferences 源码分析
- Cupboard and Balloons
- Struts2常用标签及解释。
- python命名规范
- Ueditor自定义功能问题
- Highways_poj2485_最小生成树
- byte-array-to-string-transformer 作用
- Linux Eclipse之Android NDK
- 服务器维护
- Leetcode 240. Search a 2D Matrix II
- 设置status bar字体颜色的优化方案
- javascript的缓动效果(第1部分)
- 写给未来的你——余光中
- ubuntu命令行的路径太长 如何缩短显示?