POJ 2631 -- Roads in the North【树的直径 】
来源:互联网 发布:东阳市农村淘宝分布 编辑:程序博客网 时间:2024/06/04 20:14
Roads in the North
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescription
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
此题为一般树的直径问题,但唯一奇葩的是不输出结果就可以过
#include<stdio.h>#include<string.h>#include<algorithm>#include<queue>using namespace std;#define M 310000struct node {int v,next,w;}mp[M*3];int cnt,head[M],dis[M],vis[M];int ans,last;void add(int u,int v,int w){mp[cnt].v=v;mp[cnt].w=w;mp[cnt].next=head[u];head[u]=cnt++;}void bfs(int s){queue<int> q;memset(vis,0,sizeof(vis));memset(dis,0,sizeof(dis));vis[s]=1;last=s;ans=0;q.push(s);while(!q.empty()){int u=q.front();q.pop();for(int i=head[u];i!=-1;i=mp[i].next){int v=mp[i].v;if(!vis[v] && dis[v]<dis[u]+mp[i].w){vis[v]=1;dis[v]=dis[u]+mp[i].w;if(ans<dis[v]){ans=dis[v];last=v;}q.push(v);}}}}int main(){int t,n,m,a,b,c,k=1;char ch;cnt=0;memset(head,-1,sizeof(head));while(~scanf("%d%d%d",&a,&b,&c)){//for(int i=0;i<n-1;i++){//scanf("%d %d %d %c",&a,&b,&c,&ch);add(a,b,c);add(b,a,c);}bfs(1);bfs(last);printf("%d\n",ans);return 0;}
0 0
- 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(树的直径)
- POJ Problem 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 【树的直径】
- Roads in the North 【树的直径】
- 树的直径学习小记 Poj 1985 Cow Marathon+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(村庄最大距离,树的直径,经典题目)
- Go语言的特性
- C++代理 Surrogate
- jQuery插件开发全解析
- IOS计算清理缓存
- 绕呜缺谈籽滋脸偕内梢
- POJ 2631 -- Roads in the North【树的直径 】
- JQuery之事件操作
- 自定义tab,下边是viewpager。滑动viewpager,tab跟着动,点击tab,有动画效果并且viewpager也动。
- 《Windows环境下32位汇编语言程序设计(第2版)》-chapter17知识点
- 算法
- tcp/ip 程序 (改进版) client.h
- oracle sqlldr控制文件模板
- 判断给出的序列是不是一个二叉搜索树的后序遍历
- background-size解决样式冲突