• Poj2395--Out of Hay(最小生成树)


    Out of Hay
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 13588   Accepted: 5259

    Description

    The cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farms (numbered 1..N); Bessie starts at Farm 1. She'll traverse some or all of the M (1 <= M <= 10,000) two-way roads whose length does not exceed 1,000,000,000 that connect the farms. Some farms may be multiply connected with different length roads. All farms are connected one way or another to Farm 1. 

    Bessie is trying to decide how large a waterskin she will need. She knows that she needs one ounce of water for each unit of length of a road. Since she can get more water at each farm, she's only concerned about the length of the longest road. Of course, she plans her route between farms such that she minimizes the amount of water she must carry. 

    Help Bessie know the largest amount of water she will ever have to carry: what is the length of longest road she'll have to travel between any two farms, presuming she chooses routes that minimize that number? This means, of course, that she might backtrack over a road in order to minimize the length of the longest road she'll have to traverse.

    Input

    * Line 1: Two space-separated integers, N and M. 

    * Lines 2..1+M: Line i+1 contains three space-separated integers, A_i, B_i, and L_i, describing a road from A_i to B_i of length L_i.

    Output

    * Line 1: A single integer that is the length of the longest road required to be traversed.

    Sample Input

    3 3
    1 2 23
    2 3 1000
    1 3 43

    Sample Output

    43

    Hint

    OUTPUT DETAILS: 

    In order to reach farm 2, Bessie travels along a road of length 23. To reach farm 3, Bessie travels along a road of length 43. With capacity 43, she can travel along these roads provided that she refills her tank to maximum capacity before she starts down a road.

    Source

     
    最小生成树最长边;
    #include <cstdio>
    #include <cstring>
    #define N 2001
    const int INF = 0x3f3f3f3f;
    int dis[N], vis[N], map[N][N];
    int n, m, maxlen;
    void Prime()
    {
        memset(vis, 0, sizeof(vis));
        for(int i = 1; i <= n; i++)
            dis[i] = map[1][i];
        vis[1] = 1; 
        for(int i = 1; i < n; i++){
            int temp, min = INF;
            for(int j = 1; j <= n; j++)
                if(!vis[j] && dis[j] < min){
                    temp = j;
                    min = dis[j];
                }
            if(min==INF)
                return;
            vis[temp] = 1;
            if(dis[temp] > maxlen)
                maxlen = dis[temp];
            for(int j = 1; j <= n; j++)
                if(!vis[j] && dis[j] > map[temp][j])
                    dis[j] = map[temp][j];
        }
    }
    int main()
    {
        while(scanf("%d%d", &n, &m) != EOF)
        {
            maxlen = -1;
            for(int i = 1; i <= n; i++)
                for(int j = 1; j <= n; j++)
                    map[i][j] = -1;
            for(int i = 0; i < m; i++)
            {
                int a, b, c;
                scanf("%d%d%d", &a, &b, &c);
                if(map[a][b] == -1 || map[a][b] > c)
                    map[a][b] = map[b][a]=c;
            }
            for(int i = 1; i <= n; i++)
                for(int j = 1; j <= n; j++)
                    if(map[i][j] == -1)
                        map[i][j] = INF;
            Prime();
            printf("%d
    ", maxlen);
        }    
        return 0;
    } 
  • 相关阅读:
    JVM 内存布局
    线程池总结
    Redis持久化
    Java编程基础
    toString()、String.valueOf、(String)强转
    4 种主流的 API 架构风格对比
    kubernetes 节点设置不可调度
    Linux下如何查看哪些进程占用的CPU内存资源最多
    Linux openssl1.0.2k升级openssl1.1.1e版本教程
    对一些权限题密码的说明
  • 原文地址:https://www.cnblogs.com/soTired/p/5087169.html
Copyright © 2020-2023  润新知