zoukankan      html  css  js  c++  java
  • POJ 2485 Highways

    Highways
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 21315   Accepted: 9822

    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


    最小生成树的计算,非常高兴。第一次写这样的题。一遍A。



    AC代码例如以下:



    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    using namespace std;
    
    struct H
    {
        int l,r,le;
    }map[300000];
    
    int f[505];
    
    int find(int a)
    {
        return f[a]==a ?

    f[a] :find (f[a]); } bool cmp(H a,H b) { return a.le<b.le; } int main() { int t; int n; int i,j; int a,tt; scanf("%d",&t); while(t--) { tt=0; scanf("%d",&n); for(i=1;i<=n;i++) f[i]=i; for(i=1;i<=n;i++) for(j=1;j<=n;j++) { scanf("%d",&a); if(j<=i) { map[tt].l=i; map[tt].r=j; map[tt].le=a; tt++;//统计边权和端点 } } sort(map,map+tt,cmp); int ans=0,max=0; for(i=0;i<tt;i++) { int xx,yy; xx=find(map[i].l); yy=find(map[i].r);//并查集 if(xx!=yy) { f[xx]=yy; ans+=map[i].le; if(max<map[i].le) max=map[i].le;//找到最大的一段 } } printf("%d ",max); } return 0; }





    版权声明:本文博客原创文章。博客,未经同意,不得转载。

  • 相关阅读:
    css固定底部的四种方法 CSS经典布局-Sticky footer布局
    Vue 中引入jquery
    js在ios中碰到的问题
    解决jq.autocomplete.js插件在三级联动中由于异步请求表单验证卡顿出错问题
    解决vue项目在ie中打开显示空白问题
    vue访问外部链接会拼接默认路径的问题
    jquery.autocomplete联想补全插件及使用中遇到的问题
    360浏览器记住密码状态表单自动填充问题
    JavaScript引入百度地图标注点与坐标偏移问题
    vue项目中开启Eslint碰到的一些问题及其规范
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/4735920.html
Copyright © 2011-2022 走看看