太阳集团53138.com

  • [梨园传奇]京剧《秦琼卖马》片断 表演:傅希如 2019-05-24
  • 董卿素颜接孩子放学 学费18万幼儿园曝光学费董卿-大陆 2019-05-24
  • 推动英中经贸合作 伦敦金融城市长访华 2019-05-24
  • 中国同欧盟成员国首次举行外长集体对话 2019-05-24
  • 你自立的样子真帅!男孩天生短臂仅有3指 是最美大学生还是体育健儿 2019-05-24
  • 为确保非公开发行股票顺利推进 华控赛格定增两年未果要延… 2019-05-24
  • 炸酱面的做法 炸酱面怎么做好吃 2019-05-24
  • 港城警事:暖心民警劝送醉酒老汉回家 2019-05-24
  • 交通部新规征求意见:共享单车等押金应当日退还 2019-05-24
  • 私募备案须知的确已有新版本 将于近期推出 2019-05-24
  • 资讯最新新闻全球最新新闻资讯 2019-05-23
  • 行业舆情观察:医美的“坑”防不胜防 2019-05-23
  • 山东青岛候鸟迁徙过境胶州湾 成壮观过境潮 2019-05-23
  • 通讯:为中马友谊“建好房、铺好路” 2019-05-23
  • 阿根廷海警向中国渔船开火 多轮射击枪声密集 2019-05-23
  • poj-2485 Highways

    太阳集团53138.com www.pema-photograph.com 3/8/2017来源:ASP.NET技巧人气:8472

    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; }