zoukankan      html  css  js  c++  java
  • poj2485 Highways 最小生成树

    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
     
     
     
     
     

    #include<stdio.h>
    #include<string.h>
    int map[505][505];
    int dis[505],vis[505];
    int n;
    int prim(int u){
    int tmax=0;
    for(int i=1;i<=n;i++){
    dis[i]=map[u][i];
    }
    vis[u]=1;
    for(int k=1;k<n;k++){
    int tmin=999999999;
    int temp;
    for(int j=1;j<=n;j++){
    if(dis[j]<tmin&&!vis[j]){
    tmin=dis[j];
    temp=j;
    }
    }
    vis[temp]=1;
    if(tmin>tmax)
    tmax=tmin;
    for(int i=1;i<=n;i++){
    if(dis[i]>map[temp][i]&&!vis[i])
    dis[i]=map[temp][i];
    }
    }
    return tmax;
    }
    int main(){
    int t;
    scanf("%d",&t);
    while(t--){
    memset(vis,0,sizeof(vis));
    memset(dis,0,sizeof(dis));
    memset(map,0,sizeof(map));
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
    for(int j=1;j<=n;j++){
    scanf("%d",&map[i][j]);
    }
    }
    printf("%d ",prim(1));
    printf(" ");
    }
    return 0;
    }

  • 相关阅读:
    双USB墙壁电源插座面板....制作详解-电子产品世界论坛
    公共充电站?不用守着手机充电了 | 爱范儿
    公司简介-远能电气
    连接器|网络滤波连接器|电脑连接器|RJ45变压器-华联威电子有限公司
    自己动手做简单移动电源
    移动电源市场有多乱?
    聚合物电池_百度百科
    电芯:聚合物的一定比18650更好_移动电源_移动电源评测-中关村在线
    图文:充电宝租借自助机现身江城_新浪财经_新浪网
    不按时归还,信用会有“污点”_新浪浙江_新浪网
  • 原文地址:https://www.cnblogs.com/13224ACMer/p/4629911.html
Copyright © 2011-2022 走看看