zoukankan      html  css  js  c++  java
  • Out of Hay

    Out of Hay
    Time Limit: 1000MS Memory Limit: 65536K
    Total Submissions: 13094 Accepted: 5078

    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
    USACO 2005 March Silver
    求最小生成树的最大边,Kruskal

    #include <iostream>
    #include <cmath>
    #include <cstring>
    #include <cstdlib>
    #include <stdio.h>
    #include <string>
    #include <queue>
    #include <vector>
    #include <algorithm>
    #define LL long long
    using namespace std;
    
    const int INF = 0x3f3f3f3f;
    
    const int MAX = 11000;
    
    int n,m;
    
    int pre[3000];
    
    typedef struct node
    {
        int x;
        int y;
        int  dis;
    }K;
    K Edge[MAX];
    void init()
    {
        for(int i=1;i<=n;i++)
        {
            pre[i]=i;
        }
    }
    bool cmp(node a,node b)
    {
        return a.dis<b.dis;
    }
    
    int Find(int x)
    {
        return x==pre[x]?x:pre[x]=Find(pre[x]);
    }
    
    int Kruskal()
    {
        int num=0,Max=0;
        for(int i=0;i<m;i++)
        {
            int a=Find(Edge[i].x);
            int b=Find(Edge[i].y);
            if(a!=b)
            {
                num++;
                pre[a]=b;
                if(Max<Edge[i].dis)
                {
                    Max=Edge[i].dis;
                }
            }
            if(num==n-1)
            {
                break;
            }
        }
        return Max;
    }
    int main()
    {
        while(~scanf("%d %d",&n,&m))
        {
            init();
            for(int i=0;i<m;i++)
            {
                scanf("%d %d %d",&Edge[i].x,&Edge[i].y,&Edge[i].dis);
            }
            sort(Edge,Edge+m,cmp);
            printf("%d
    ",Kruskal());
        }
        return 0;
    }
    
  • 相关阅读:
    用leangoo看板工具实施多团队大规模敏捷开发
    单团队的Scrum敏捷开发-leangoo
    放弃在每日站会上按成员逐个发言
    Leangoo思维导图做OKR目标管理
    好用的思维导图软件(程序员必备)
    好用免费的思维导图工具,多人协作共同编辑
    什么是Scrum燃尽图?
    Scrum中文网-团队需要Scrum Master做这六件事
    项目管理工具Leangoo自定义字段的应用
    实施敏捷开发中,选择看板管理工具的几个要点
  • 原文地址:https://www.cnblogs.com/juechen/p/5256000.html
Copyright © 2011-2022 走看看