poj--2631--Roads in the North(树的直径 裸模板)
2016-01-12 20:46
411 查看
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
Sample Output
Source
The UofA Local 1999.10.16
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 2389 | Accepted: 1173 |
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
Source
The UofA Local 1999.10.16
#include<stdio.h> #include<string.h> #include<queue> #include<algorithm> using namespace std; #define MAXN 10010 int Node,m,n,cnt,ans; int head[MAXN],dis[MAXN],vis[MAXN],pre[MAXN]; struct node { int u,v,val; int next; }edge[MAXN]; void init() { memset(head,-1,sizeof(head)); cnt=0; for(int i=0;i<10010;i++) pre[i]=i; } void add(int u,int v,int val) { node E={u,v,val,head[u]}; edge[cnt]=E; head[u]=cnt++; } void bfs(int sx) { memset(vis,0,sizeof(vis)); memset(dis,0,sizeof(dis)); ans=0; queue<int>q; Node=sx; q.push(Node); vis[Node]=1; while(!q.empty()) { int u=q.front(); q.pop(); for(int i=head[u];i!=-1;i=edge[i].next) { node E=edge[i]; if(!vis[E.v]) { vis[E.v]=1; dis[E.v]=dis[u]+E.val; q.push(E.v); } } } for(int i=1;i<=cnt;i++) { if(ans<dis[i]) { ans=dis[i]; Node=i; } } } void slove() { bfs(1); bfs(Node); printf("%d\n",ans); } int main() { int a,b,c; init(); while(scanf("%d%d%d",&a,&b,&c)!=EOF) { add(a,b,c); add(b,a,c); } slove(); return 0; }
相关文章推荐
- 通过ssh操作IOS亮屏解锁打开app
- c# json操作
- C#实现MD5加密
- AppleScript学习(重要)
- svn -- svn简介
- html与htm的区别
- 频繁出现的数值
- 基于Windows Socket的安全通信(C++实现,附源码)
- 唤醒身体
- ubuntu常用命令(笔记)
- dogse入门指南
- Markdown 语法
- 从实体和关系角度看 PowerDesigner 设计数据库模型
- 我来学习excel------count函数
- Springmvc json加载数据 前端拼接技术
- oracle11g 手工建库
- python exception
- Tomcat 使用apr优化
- C Primer Plus(第五版)8
- vs调试,监控变量