POJ 1985-Cow Marathon【树的直径模板】
来源:互联网 发布:网络销售工作总结范文 编辑:程序博客网 时间:2024/06/15 06:08
Cow Marathon
Time Limit: 2000MS Memory Limit: 30000KTotal Submissions: 4583 Accepted: 2265Case Time Limit: 1000MS
Description
After hearing about the epidemic of obesity in the USA, Farmer John wants his cows to get more exercise, so he has committed to create a bovine marathon for his cows to run. The marathon route will include a pair of farms and a path comprised of a sequence of roads between them. Since FJ wants the cows to get as much exercise as possible he wants to find the two farms on his map that are the farthest apart from each other (distance being measured in terms of total length of road on the path between the two farms). Help him determine the distances between this farthest pair of farms.
Input
* Lines 1.....: Same input format as "Navigation Nightmare".
Output
* Line 1: An integer giving the distance between the farthest pair of farms.
Sample Input
7 61 6 13 E6 3 9 E3 5 7 S4 1 3 N2 4 20 W4 7 2 S
Sample Output
52
Hint
The longest marathon runs from farm 2 via roads 4, 1, 6 and 3 to farm 5 and is of length 20+3+13+9+7=52.
解题思路:
树的直径,来,上模板。不用考虑最后那个方向,就是拿来逗人的。
#include <iostream>#include<stdio.h>#include <string.h>#define MAXN 60005#define INF 0x3f3f3f3fusing namespace std;struct Edge{ int v, w, next;}edge[MAXN*6];int m,head[MAXN], vis[MAXN], d[MAXN], q[MAXN], e, n;int init(){ e = 0; memset(head, -1, sizeof(head));}void add(int u, int v, int w){ edge[e].v = v; edge[e].w = w; edge[e].next = head[u]; head[u] = e++;}void bfs(int src){ for (int i = 1; i <= n; i++) { vis[i] = 0; d[i] = INF; } int h = 0, t = 0; vis[src] = 1; q[t++] = src; d[src] = 0; while (h < t) { int u = q[h++]; for (int i = head[u]; i != -1; i = edge[i].next) { int v = edge[i].v; int w = edge[i].w; if (d[u] + w < d[v]) { d[v] = d[u] + w; if (!vis[v]) { q[t++] = v; vis[v] = 1; } } } }}int main(){ int u, v, w;while(scanf("%d%d",&n,&m)!=EOF){init();char pp; for (int i=1;i<=m; i++) { scanf("%d%d%d %c",&u,&v,&w,&pp); add(u, v, w); add(v, u, w); } bfs(1); int pos = 0, mx = -1; for (int i = 1; i <= n; i++) { if(d[i] > mx) { mx = d[i]; pos = i; } } bfs(pos); mx = -1; for (int i = 1; i <= n; i++) { if(d[i] > mx) { mx = d[i]; } } printf("%d\n",mx);} return 0;}
0 0
- POJ 1985--Cow Marathon【树的直径 && 模板】
- POJ 1985-Cow Marathon【树的直径模板】
- poj 1985 Cow Marathon (树的直径 模板题)
- POJ 1985 Cow Marathon 树的直径
- POJ 1985 Cow Marathon 树的直径
- 【树的直径】 POJ 1985 Cow Marathon
- poj 1985 Cow Marathon 【树的直径】
- POJ 1985 Cow Marathon(树的直径)
- poj 1985 Cow Marathon 【树的直径】
- poj-1985-Cow Marathon【树的直径】
- poj 1985 Cow Marathon 树的直径
- Poj 1985 Cow Marathon ( 树的直径
- [POJ 1985][树的直径]Cow Marathon
- poj 1958 Cow Marathon(树的直径,模板题)
- poj 1985 Cow Marathon(树直径)
- [poj 1985]Cow Marathon[求树的直径][BFS]
- [POJ 1985] Cow Marathon (树的直径)
- BZOJ 3363 POJ 1985 Cow Marathon 树的直径
- IOS实现自动循环滚动广告--ScrollView的优化和封装
- android 刮刮卡效果
- C++实验4—输出星号图
- SCRIPT5039: 重新声明常量属性 遇到js错误,在IE9下会调试脚本会出现
- 禁用页面中的a标签,使其不可跳转
- POJ 1985-Cow Marathon【树的直径模板】
- Boyer-Moore 算法 与KMP算法的对比
- jquery submit()不能提交表单的解决方法
- JSTL标签变量Map集合
- centos7之lamp环境搭建
- HTML5开发
- 虚拟机安装window xp问题总结
- Max Script|物体选择和拷贝
- Spring容器简单理解