zoukankan      html  css  js  c++  java
  • 【POJ】[2631]Roads in the North

    Roads in the North
    Time Limit: 1000MS   Memory Limit: 65536K

    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


    运用DFS求树的直径


    #include<stdio.h>
    #include<string.h>
    int head[10200];
    int headcnt;
    int max,t;
    struct List {
    	int u,v,w;
    	int next;
    } edge[10200];
    void add(int u,int v,int w) {
    	edge[headcnt].u=u;
    	edge[headcnt].v=v;
    	edge[headcnt].w=w;
    	edge[headcnt].next=head[u];
    	head[u]=headcnt++;
    }
    void dfs(int u,int v,int w) {
    	if(max<w)
    		max=w,t=u;
    	for(int i=head[u]; i!=-1; i=edge[i].next) {
    		if(edge[i].v!=v)
    			dfs(edge[i].v,u,w+edge[i].w);
    		}
    }
    int main() {
    	headcnt=0;
    	memset(head,-1,sizeof(head));
    	int u,v,w;
    	while(scanf("%d %d %d",&u,&v,&w)!=EOF) {
    		add(u,v,w);
    		add(v,u,w);
    	}
    	max=0;
    	dfs(1,0,0);
    	dfs(t,0,0);
    	printf("%d
    ",max);
    	return 0;
    }
    



    题目地址:【POJ】[2631]Roads in the North

  • 相关阅读:
    codevs 1160 蛇形矩阵
    进程同步-进程内部也需要锁
    进程间通讯-3(Manager)-实现数据的同时修改
    进程间通讯-2(pipe)
    python 中的queue 与多进程--待继续
    进程间通讯-1-传递函数的方法
    多进程
    queue队列
    python-输出颜色显示
    python深浅copy-转自EVA的博客
  • 原文地址:https://www.cnblogs.com/BoilTask/p/12569439.html
Copyright © 2011-2022 走看看