69视频

poj-2485 Highways_ASP.NET技巧_动态网站制作指南

3/8/2017来源:ASP.NET技巧人气:8936

Highways Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30003 Accepted: 13656 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.

描述 :有个城市叫做H市。其中有很多个村庄,村庄之间通信基本靠吼,交通基本靠走,很不方便。 这个市长知道了这个情况,为了替市民着想,决定修建高铁。每修建一米花费1美元。 现在市长请了最著名的工程师来修建高铁,自然这个工程师会让修建高铁的费用最少。 不幸的是,在修建了高铁之后就病逝了。现在市长希望知道在修建完成的这些高铁路中最长的一段高铁路花费了多少美元, 他请你来帮助他,如果你计算正确,市长将会送你一辆兰博基尼。 输入: 第一行一个数T,表示接下来有多少组数据。 接下来每组测试数据的第一行有一个数N(3<=N<=500), 表示村庄数目。 然后是一个二维数组,第 i行第j列表示第i个村庄到第j个村庄的距离。 输出: 只有一个数,输出市长希望知道的已经修成的高铁中最 长的路花了多少钱。

代码:

#include <stdio.h> #define min(a,b) a<b?a:b #define max(a,b) a>b?a:b int map[505][505]; int vis[505],s[505];// vis表示该点到每个顶点的最小值,s标记顶点 int inf=999999; int main() { int t,n; scanf("%d",&t); while(t--) { int i,j; int res[505],ans; scanf("%d",&n); for(i=1;i<=n;i++){ vis[i]=inf; s[i]=0;// } vis[1]=0; for(i=1;i<=n;i++){ for(j=1;j<=n;j++){ scanf("%d",&map[i][j]); } } int f=1; for(int k=1;k<=n;k++){ int v=0; for(i=1;i<=n;i++){ if(!s[i] && (v==0||vis[i]<vis[v])) v=i; } if(i==0) break; s[v]=1;//标记 res[f++]=vis[v]; // res+=vis[v]; for(j=1;j<=n;j++){//松弛操作 if(!s[i]) vis[j]=min(vis[j],map[v][j]); } } for(i=2;i<=n;i++){ ans=max(res[i-1],res[i]); } printf("%d\n",ans); } return 0; }

色老哥_人人爱添_我去也 VA视频_欧美性狠狠_97资源站总站在线观看 69视频最新黄色网址_中文字幕 无码亚洲_中文字幕乱倫视频 在线看av_中文字幕av_中文字幕乱偷在线 操比电影_VA视频_丁香婷婷 亚洲另类_无码在线视频_中文字幕av 69公社_色吊丝中文字幕_婷婷丁香五月花 色啪_色噜噜2017最新综合_中文字幕av 中文字幕av_97碰_中文字幕日本无吗 爱情福利_巨乳波霸在线中文字幕_中文字幕在线观看2o18

免责声明: 本站资料及图片来源互联网文章-|,本网不承担任何由内容信息所引起的争议和法律责任。所有作品版权归原创作者所有,与本站立场无关-|,如用户分享不慎侵犯了您的权益,请联系我们告知,-|我们将做删除处理!