• POJ2485 Highways 【MST】


    Highways
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 22842   Accepted: 10525

    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

    求MST中的最大边

    #include <stdio.h>
    #include <string.h>
    
    #define maxn 505
    #define inf 0x3f3f3f3f
    
    int G[maxn][maxn], n;
    int dis[maxn];
    bool vis[maxn];
    
    void getMap() {
    	scanf("%d", &n);
    	int i, j;
    	for(i = 0; i < n; ++i)
    		for(j = 0; j < n; ++j)
    			scanf("%d", &G[i][j]);
    }
    
    int getNext() {
    	int i, pos = -1, val = inf;
    	for(i = 0; i < n; ++i)
    		if(!vis[i] && dis[i] < val) {
    			val = dis[i]; pos = i;
    		}
    	return pos;
    }
    
    void solve() {
    	int i, u, ans = 0;
    	for(i = 0; i < n; ++i) {
    		vis[i] = 0; dis[i] = inf;
    	}
    	dis[u=0] = 0;
    	while(u != -1) {
    		vis[u] = 1;
    		if(ans < dis[u]) ans = dis[u];
    		for(i = 0; i < n; ++i)
    			if(!vis[i] && dis[i] > G[u][i])
    				dis[i] = G[u][i];
    		u = getNext();
    	}
    	printf("%d
    ", ans);
    }
    
    int main() {
    	int t;
    	scanf("%d", &t);
    	while(t--) {
    		getMap();
    		solve();
    	}
    	return 0;
    }


  • 相关阅读:
    Linux基本结构
    Linux诞生
    Python之克隆
    Python之数据类型转换
    gb18030与utf-8
    for循环与while循环
    code::blocks调试
    关于隐式创建vue实例实现简化弹出框组件显示步骤
    blob canvas img dataUrl的互相转换和用处
    观察者模式与发布订阅模式的区别
  • 原文地址:https://www.cnblogs.com/jhcelue/p/7048151.html
Copyright © 2020-2023  润新知