zoukankan      html  css  js  c++  java
  • poj 1797 Heavy Transportation(最大生成树)

    poj 1797 Heavy Transportation

    Description
    Background
    Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where it is needed on which all streets can carry the weight.
    Fortunately he already has a plan of the city with all streets and bridges and all the allowed weights.Unfortunately he has no idea how to find the the maximum weight capacity in order to tell his customer how heavy the crane may become. But you surely know.

    Problem
    You are given the plan of the city, described by the streets (with weight limits) between the crossings, which are numbered from 1 to n. Your task is to find the maximum weight that can be transported from crossing 1 (Hugo’s place) to crossing n (the customer’s place). You may assume that there is at least one path. All streets can be travelled in both directions.

    Input
    The first line contains the number of scenarios (city plans). For each city the number n of street crossings (1 <= n <= 1000) and number m of streets are given on the first line. The following m lines contain triples of integers specifying start and end crossing of the street and the maximum allowed weight, which is positive and not larger than 1000000. There will be at most one street between each pair of crossings.

    Output
    The output for every scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. Then print a single line containing the maximum allowed weight that Hugo can transport to the customer. Terminate the output for the scenario with a blank line.

    Sample Input

    1
    3 3
    1 2 3
    1 3 4
    2 3 5

    Sample Output

    Scenario #1:
    4

    题目大意:给出一张图,求从1到n的路径上权值的最大的最小值。

    解题思路:最大生成树。用Prim算法,改动一些地方即可了。

    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <cmath>
    #include <cstdlib>
    using namespace std;
    
    typedef long long ll;
    const int N = 1005;
    const int INF = 0x3f3f3f3f;
    int n, m;
    int D[N][N], dis[N], vis[N], ans;
    
    void init() {
        ans = INF;
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= n; j++) {
                D[i][j] = 0;    
            }
        }
        for (int i = 0; i <= n; i++) dis[i] = 0;
        for (int i = 0; i <= n; i++) vis[i] = 0;
    }
    
    void input() {
        scanf("%d%d", &n, &m);
        int a, b, len;
        for (int i = 0; i < m; i++) {
            scanf("%d %d %d", &a, &b, &len);
            D[a][b] = D[b][a] = len;
        }
    }
    
    void Prim() {
        int k;
        for (int i = 1; i <= n; i++) {
            dis[i] = D[1][i];
        }
        vis[1] = 1;
        for (int i = 0; i < n - 1; i++) {
            int L = -2;
            for (int j = 1; j <= n; j++) {
                if (!vis[j] && dis[j] > L) {
                    L = dis[j];
                    k = j;
                }   
            }
            if (ans > L) ans = L;    
            if (k == n) break;
            vis[k] = 1;
            for (int j = 1; j <= n; j++) {
                if (!vis[j] && D[j][k] > dis[j]) {
                    dis[j] = D[j][k];
                }   
            }
        }
        printf("%d
    
    ", ans);
    }
    
    int main() {
        int T, Case = 1;
        scanf("%d", &T);
        while (T--) {
            printf("Scenario #%d:
    ", Case++);
            init();
            input();
            Prim();
        }
        return 0;
    }
  • 相关阅读:
    EMC、Pure和NetApp推新品,NAS闪存场景在哪里
    Tomcat 开启Gzip压缩
    win10+ubuntu双系统安装方案
    游戏中水的渲染技术系列一
    什么时候用到线程
    高并发和多线程
    angularJS双向绑定和依赖反转
    javascript ES6
    angularJS核心原理
    javascript限定输入textarea输入长度
  • 原文地址:https://www.cnblogs.com/zsychanpin/p/7341622.html
Copyright © 2011-2022 走看看