• 题解报告:poj 2631 Roads in the North(最长链)


    Description

    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
    AC代码:
     1 #include<iostream>
     2 #include<string.h>
     3 #include<cstdio>
     4 using namespace std;
     5 const int maxn=1e4+5;
     6 struct node{int to,cap,next;}edge[maxn<<1];
     7 int x,y,w,cnt,maxdist,head[maxn];
     8 void add_edge(int u,int v,int w){
     9     edge[cnt].to=v;
    10     edge[cnt].cap=w;
    11     edge[cnt].next=head[u];
    12     head[u]=cnt++;
    13 }
    14 int dfs(int u,int fa,int &maxdist){
    15     int Dmax=0,Dsec=0;
    16     for(int i=head[u];~i;i=edge[i].next){
    17         int v=edge[i].to;
    18         if(v^fa){
    19             int nowd=dfs(v,u,maxdist)+edge[i].cap;
    20             if(nowd>Dmax)Dsec=Dmax,Dmax=nowd;
    21             else if(nowd>Dsec)Dsec=nowd;
    22         }
    23     }
    24     maxdist=max(maxdist,Dmax+Dsec);
    25     return Dmax;
    26 }
    27 int main(){
    28     memset(head,-1,sizeof(head));maxdist=cnt=0;
    29     while(~scanf("%d %d %d",&x,&y,&w)){
    30         add_edge(x,y,w);
    31         add_edge(y,x,w);
    32     }
    33     dfs(1,-1,maxdist);
    34     printf("%d
    ",maxdist);
    35     return 0;
    36 }
  • 相关阅读:
    第二次公共考试,判断错题集
    云助理里面查询渠道的方法
    公司第二阶段公共考试题
    云助理绑定手机及密码找回方法
    oracle的卸载
    pl/sql进阶--例外处理
    oracle--dba和表的备份与恢复
    oracle触发器
    oracle视图
    pl/sql的介绍
  • 原文地址:https://www.cnblogs.com/acgoto/p/9611165.html
Copyright © 2020-2023  润新知