zoukankan      html  css  js  c++  java
  • poj 2485 -- Highways

    Highways
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 21324   Accepted: 9828

    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
    
    水题一道。最小生成树,不解释。

     1 /*======================================================================
     2  *           Author :   kevin
     3  *         Filename :   Highways.cpp
     4  *       Creat time :   2014-07-09 15:05
     5  *      Description :
     6 ========================================================================*/
     7 #include <iostream>
     8 #include <algorithm>
     9 #include <cstdio>
    10 #include <cstring>
    11 #include <queue>
    12 #include <cmath>
    13 #define clr(a,b) memset(a,b,sizeof(a))
    14 #define M 600
    15 #define INF 0x7f7f7f7f
    16 using namespace std;
    17 int c[M][M],dis[M];
    18 int prim(int n)
    19 {
    20     bool vis[M];
    21     int i,j,k,sum = 0;
    22     for(i = 0; i < n; i++){
    23         dis[i] = c[0][i];
    24         vis[i] = false;
    25     }
    26     vis[0] = true;
    27     for(i = 1; i < n; i++){
    28         int _min = INF;
    29         j = 0;
    30         for(k = 0; k < n; k++){
    31             if(_min > dis[k] && !vis[k]){
    32                 _min = dis[k];
    33                 j = k;
    34             }
    35         }
    36         vis[j] = true;
    37         if(sum < _min){
    38             sum = _min;
    39         }
    40         for(k = 0; k < n; k++){
    41             if(dis[k] > c[j][k] && !vis[k]){
    42                 dis[k] = c[j][k];
    43             }
    44         }
    45     }
    46     return sum;
    47 }
    48 int main(int argc,char *argv[])
    49 {
    50     int cas,n,value;
    51     scanf("%d",&cas);
    52     while(cas--){
    53         clr(c,0);
    54         scanf("%d",&n);
    55         for(int i = 0; i < n; i++){
    56             for(int j = 0; j < n; j++){
    57                 scanf("%d",&value);
    58                 c[i][j] = value;
    59             }
    60         }
    61         int ans = prim(n);
    62         printf("%d
    ",ans);
    63     }
    64     return 0;
    65 }
    View Code
    Do one thing , and do it well !
  • 相关阅读:
    几种连接数据库的OLEDB驱动程序
    Javascript如何访问和处理系统文件
    如何自学Java 经典
    Android Studio 修改 包名
    Android Studio -导入项目 gradle处理
    Android Studio- 把项目提交到SVN中操作方法
    android studio 运行太慢了
    Java多线程 -sleep 用法详解
    Java -native 方法
    Java多线程 -yield用法
  • 原文地址:https://www.cnblogs.com/ubuntu-kevin/p/3833709.html
Copyright © 2011-2022 走看看