【POJ】[2631]Roads in the North
来源:互联网 发布:手机站优化 编辑:程序博客网 时间:2024/06/05 04:04
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.
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 61 4 56 3 92 6 86 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\n",max);return 0;}
题目地址:【POJ】[2631]Roads in the North
0 0
- POJ - 2631 Roads in the North
- poj 2631 Roads in the North
- POJ 2631 Roads in the North
- B - Roads in the North POJ-2631
- POJ 2631Roads in the North【裸题】
- 【POJ 2631 Roads in the North】
- 【POJ】[2631]Roads in the North
- POJ 2631 Roads in the North 笔记
- Roads in the North POJ
- POJ 2631 Roads in the North POJ 1985 Cow Marathon
- POJ 2631 Roads in the North(树形dp)
- POJ 2631 Roads in the North 树的直径
- 【树的直径】 POJ 2631 Roads in the North
- POJ 2631 Roads in the North(树的直径)
- poj 2631 Roads in the North(裸树的直径)
- POJ 2631 -- Roads in the North【树的直径 && 裸题】
- POJ 2631 Roads in the North(树的直径)
- 【POJ】2631 - Roads in the North(树的直径)
- 百度地图 标注 显示信息 Marker单击事件 代码参考
- Recommender System ——charu C. Aggarwal学习笔记【2】
- 杭电4004The Frog's Games
- 高精度计算(一)概念
- emacs+slime+sbcl搭建common lisp环境
- 【POJ】[2631]Roads in the North
- centos 7修改打开文件数限制
- java设计模式-原型模式
- [Cloud Computing]Patterns: Elastic Resource Capacity
- 头部固定效果
- Add Digits
- android标题栏详解3
- 大公司都有哪些开源项目~~~阿里,百度,腾讯,360,新浪,网易,小米等
- 点击Input框弹出日期选项