zoukankan      html  css  js  c++  java
  • Roads in the North (树的直径)

    Building and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that there is only one route from a village to a village that does not pass through some other village twice. 
    Given is an area in the far North comprising a number of villages and roads among them such that any village can be reached by road from any other village. Your job is to find the road distance between the two most remote villages in the area. 

    The area has up to 10,000 villages connected by road segments. The villages are numbered from 1. 

    Input

    Input to the problem is a sequence of lines, each containing three positive integers: the number of a village, the number of a different village, and the length of the road segment connecting the villages in kilometers. All road segments are two-way.

    Output

    You are to output a single integer: the road distance between the two most remote villages in the area.

    Sample Input

    5 1 6
    1 4 5
    6 3 9
    2 6 8
    6 1 7
    

    Sample Output

    22

    代码:
    #include<cstdio>
    #include<iostream>
    #include<cstring>
    #include<algorithm>
    #include<queue>
    #include<stack>
    #include<set>
    #include<map>
    #include<vector>
    #define Inf 0x3f3f3f3f
    
    const int maxn=1e4+5;
    typedef long long ll;
    using namespace std;
    struct edge
    {
        int to,cost;
    };
    
    vector<edge> e[maxn];
    int farthest,ans;
    void dfs(int x,int pre,int dis)
    {
        for(int i=0;i<e[x].size();i++)
        {
            int xx = e[x][i].to;
            if(xx == pre)
                continue;
            dfs(xx,x,dis+e[x][i].cost);
        }
        if(dis > ans)
        {
            ans = dis;
            farthest = x;
        }
    }
    int main()
    {
            int i,j;
           
            int x,y;
            edge t;
               while(scanf("%d%d%d",&x,&y,&t.cost)!=EOF)
               {
                t.to = y;
                e[x].push_back(t);
                t.to = x;
                e[y].push_back(t);
                }
            ans = 0;
            dfs(1,-1,0);
            
            dfs(farthest,-1,0);
            printf("%d
    ",ans);
        
     
        return 0;
    }
  • 相关阅读:
    Jmeter生成HTML报告
    Python多线程(生成动态参数)
    小程序利用canvas生成图片加文字,保存到相册
    小程序商城数量加减效果
    支付宝小程序tab切换滑动
    数据排序,从小到大,从大到小,ajax
    小程序上拉加载更多,onReachBottom
    小程序tab导航切换样式
    小程序动画Animation,高度增加动画形式,图标旋转动画形式
    iview weapp icon组件自定义图标 小程序
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/11258299.html
Copyright © 2011-2022 走看看