zoukankan      html  css  js  c++  java
  • POJ

    题目链接:

    http://poj.org/problem?id=2485

    题目:

    Highways

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 36525   Accepted: 16329

    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.

    题目意思:

    求最小生成树中最大边

    用一个变量存一下  把prime的模板代码改一下就可以了

    AC代码:

    #include <stdio.h>
    #include <string.h>
    #include <iostream>
    using namespace std;
    const int inf = 0x3f3f3f3f;
     
    int main()
    {
        int n,t,road[505][505],vis[505],sum,minroad,dis[505],maxroad;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d",&n);
            for(int i=1;i<=n;i++)
                for(int j=1;j<=n;j++)
                    scanf("%d",&road[i][j]);
            memset(vis,0,sizeof(vis));
            for(int i=1;i<=n;i++)
                dis[i]=road[1][i];
            vis[1]=1;
            int c=1;
            int i,j;
            maxroad = 0;
            while( c < n )
            {
                minroad = inf ;
                for(j=0,i=1;i<=n;i++)
                {
                    if(vis[i]==0 && minroad > dis[i])
                    {
                        minroad = dis[i];
                        j=i;
                    }
                }
                if(minroad > maxroad) maxroad = minroad;
                c++;
                vis[j]=1;
                for(i=1;i<=n;i++)
                    if(vis[i]==0 && road[j][i] < dis[i])
                        dis[i] = road[j][i];
            }
            printf("%d
    ",maxroad);
        }
    }
  • 相关阅读:
    Override 和 Overload 的含义和区别
    Java面向对象的三个特征与含义
    OOM有哪些情况,SOF有哪些情况
    Collection包结构,与Collections的区别
    ConcurrentHashMap
    HashMap 、LinkedHashMap、HashTable、TreeMap 和 Properties 的区别
    Map、Set、List、Queue、Stack的特点与用法
    程序员福利:一种养目法——周履靖《益龄单》
    String、StringBuffer、StringBuilder的区别
    喜欢的音乐
  • 原文地址:https://www.cnblogs.com/20172674xi/p/9536186.html
Copyright © 2011-2022 走看看