zoukankan      html  css  js  c++  java
  • poj2485

    Highways
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 27912   Accepted: 12734

    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

    题意:Flatopia岛要修路,这个岛上有n个城市,要求修完路后,各城市之间可以相互到达,且修的总
    路程最短.
    求所修路中的最长的路段

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<iostream>
    using namespace std;
    #define N 510
    struct node{
        int x,y,v;
    }e[N*N];
    int t,fa[N];
    bool cmp(const node &a,const node &b){
        return a.v<b.v;
    }
    int find(int x){
        return fa[x]==x?x:fa[x]=find(fa[x]);
    }
    int main(){
        scanf("%d",&t);
        while(t--){
            int n,cnt=0;
            scanf("%d",&n);
            for(int i=1;i<=n;i++) fa[i]=i;
            for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++){
                    int x;
                    scanf("%d",&x);
                    if(x){
                        e[++cnt].x=i;e[cnt].y=j;e[cnt].v=x;
                    }
                }
            }
            int k=0,res=0;
            sort(e+1,e+cnt+1,cmp);
            for(int i=1;i<=cnt;i++){
                int fx=find(e[i].x),fy=find(e[i].y);
                if(fx!=fy){
                    fa[fy]=fx;
                    k++;
                }
                if(k==n-1){
                    res=e[i].v;//因为排完序了,所以最后一个就是最大的
                    break;
                }
            }
            printf("%d
    ",res);
            for(int i=1;i<=n;i++) fa[i]=0;//养成清零好习惯 
            for(int i=1;i<=n;i++) e[i]=e[0];
        }
        return 0;
    }
  • 相关阅读:
    DIV+CSS列表式布局(同意图片的应用)
    Cache 应用程序数据缓存
    mysql 中 isnull 和 ifnull 判断字段是否为null
    Logo图标快速生成软件(Sothink Logo Maker) v3.5 官方设计师版
    Linqer工具
    mvc学习视频
    MvcPager注意版本与mvc的版本
    此版本的 SQL Server 不支持用户实例登录标志。该连接将关闭“的解决
    ASP.NET 免费开源控件
    逆向知识之CS1.6辅助/外挂专题.1.实现CS1.6主武器副武器无限子弹
  • 原文地址:https://www.cnblogs.com/shenben/p/5630447.html
Copyright © 2011-2022 走看看