POJ-----2631树的直径
来源:互联网 发布:外国人看淘宝 编辑:程序博客网 时间:2024/06/01 09:18
Roads in the North
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2652 Accepted: 1309
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
模板题,唯一恶心的地方是这道题居然没法输出,只能自己加个变量控制输出,提交时侯再删掉
#include<cstdio>#include<cstring>#include<algorithm>#include<queue>#define maxn 10010using namespace std;int ans, num, nod, x, y, z;int head[maxn], dis[maxn];bool vis[maxn];struct node{int from, to, val, next;}edge[maxn*2];void add(int u, int v, int w){edge[num].from = u;edge[num].to = v;edge[num].val = w;edge[num].next = head[u];head[u] = num++;}void bfs(int t){memset(vis, false, sizeof(vis));memset(dis, 0, sizeof(dis));queue<int > q;q.push(t);ans = dis[t] = 0;vis[t] = true;while(!q.empty()){int u = q.front();q.pop();for(int i = head[u]; i != -1; i = edge[i].next){int v = edge[i].to;if(!vis[v]){if(dis[v] < edge[i].val + dis[u]){dis[v] = edge[i].val + dis[u];}q.push(v);vis[v] = true;if(ans < dis[v]){ans = dis[v];nod = v;}}}}}int main(){int a, b, c;memset(head, -1, sizeof(head));num = 0;while(scanf("%d%d%d", &a, &b, &c) != EOF){add(a, b, c);add(b, a, c);}bfs(1);bfs(nod);printf("%d\n", ans);return 0;}
0 0
- 树的直径 poj 2631
- POJ-----2631树的直径
- [POJ-2631] 求树的直径
- poj 1985 树的直径
- POJ-----1985树的直径
- POJ 1895 Cow Marathon&&POJ 2631 树的直径
- 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 1985 hdoj 2196 <树的直径>
- 【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【树的直径 】
- SQL_电力抢修工程插入数据语句
- mysql 双机异地热备份----快速理解mysql主从,主主备份原理及实践
- CSU-ACM2016暑假集训比赛6
- Android 5.0及以上系统实现沉浸式状态栏
- SELinux(Security-Enhanced Linux)的FTP配置设置
- POJ-----2631树的直径
- git基本操作
- MAC JDK版本切换
- CSS浮动(float,clear)通俗讲解
- Winsock使用之开始使用Winsock
- TCP的拥塞控制 (Tahoe Reno NewReno SACK)
- 资源链接
- ue4 Android打包示例
- Hibernate的总结