zoukankan      html  css  js  c++  java
  • POJ 2485 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

    题意:
    求生成最小生成树时 所有边中最长的边的长度

    思路:
    把prim算法中 sum+=minn 的部分改为 sum=max(sum,minn) 即可

    代码:
    #include <iostream>
    #include <cstdio>
    #include <cstdlib>
    #include <cmath>
    #include <string>
    #include <cstring>
    #include <algorithm>
    
    using namespace std;
    typedef long long ll;
    typedef unsigned long long ull;
    const int inf=0x3f3f3f3f;
    const int maxn=550;
    int t,n,tmp;
    int mp[maxn][maxn],dis[maxn],vis[maxn];
    
    int main(){
        scanf("%d",&t);
        for(int id=1;id<=t;id++){
            scanf("%d",&n);
            memset(mp,0,sizeof(mp));
            memset(dis,0,sizeof(dis));
            memset(vis,0,sizeof(vis));
            for(int i=1;i<=n;i++){
                dis[i]=inf;
                for(int j=1;j<=n;j++){
                    scanf("%d",&mp[i][j]);
                }
            }
            for(int i=1;i<=n;i++){
                dis[i]=mp[1][i];
            }
            dis[1]=0;
            vis[1]=1;
            int sum=0;
            for(int i=1;i<=n;i++){
                tmp=inf;
                int minn=inf;
                for(int j=1;j<=n;j++){
                    if(vis[j]==0 && dis[j]<minn){
                        tmp=j;
                        minn=dis[j];
                    }
                }
                if(tmp==inf) break;
                vis[tmp]=1;
                sum=max(sum,minn);
                for(int j=1;j<=n;j++){
                    if(vis[j]==0 && dis[j]>mp[tmp][j])
                        dis[j]=mp[tmp][j];
                }
            }
            printf("%d
    ",sum);
        }
        return 0;
    }
  • 相关阅读:
    Codeforces Round #527 (Div. 3) B. Teams Forming
    Train Problem I (栈的基本运用)
    浙江中医药大学第十二届大学生程序设计竞赛 J. Jhadgre爬楼梯
    判断二进制半整数
    简易连连看
    Codeforces Round #527 (Div. 3) A. Uniform String
    求字符串中出现次数最多的字符 JAVA
    母猪的故事 (递推题)
    C#判断文件和文件夹是否存在 不存在则创建
    C# 数据库备份与还原 小妹做了一个winform系统,需要对sql2000数据库备份和还原(小妹妹你太狠了)
  • 原文地址:https://www.cnblogs.com/whdsunny/p/10529392.html
Copyright © 2011-2022 走看看