POJ-1985 Cow Marathon (最大距离)
来源:互联网 发布:cad数据恢复 编辑:程序博客网 时间:2024/05/23 12:00
Cow Marathon
Time Limit: 2000MS Memory Limit: 30000KTotal Submissions: 4948 Accepted: 2407Case 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.
Source
USACO 2004 February
AC代码:
#include<stdio.h>#include<string.h>#include<queue>#include<algorithm>using namespace std;#define G 610000struct Edge{int from,to,val,next;} edge[G*2]; //边的结构体; int edgenum; //边的数目; int head[G]; //标记点,记录地址; int dist[G]; //统计目前的最长路径; bool vis[G]; //标记参观过的点;int node ,ans;int n,m;void init(){edgenum=0;memset(head,-1,sizeof(head));}void add(int a,int b,int c){edge[edgenum].from=a;edge[edgenum].to=b;edge[edgenum].val=c;edge[edgenum].next=head[a];head[a]=edgenum++;}void BFS(int x){memset(dist,0,sizeof(dist));memset(vis,false,sizeof(vis));queue<int> Q;Q.push(x);vis[x]=true;dist[x]=0;ans=0;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(dist[v]<dist[u]+edge[i].val){dist[v]=dist[u]+edge[i].val ;if(ans<dist[v]) { ans=dist[v]; node=v; }} vis[v]=true;Q.push(v); }}}}int main(){int i;int u,v,w;char s[2];while(scanf("%d%d",&n,&m)!=EOF){init();for(i=0;i<m;i++){scanf("%d%d%d%s",&u,&v,&w,s);add(u,v,w);add(v,u,w);}BFS(1);BFS(node);printf("%d\n",ans);}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】[1985]Cow Marathon
- POJ 1985 Cow Marathon
- POJ-1985 Cow Marathon
- POJ 1985 Cow Marathon
- 【POJ 1985 Cow Marathon】
- Linux看当前硬盘剩余空间
- 史上最简单的外观模式详解
- Android5.0+(CollapsingToolbarLayout)
- Android Studio关于for if null的秘密
- Android SDK介绍
- POJ-1985 Cow Marathon (最大距离)
- MySQL 5.7系列解压版,安装详解!QAQ~
- 解决ScrollView滑动过程中ScrollTo()方法不起作用的问题
- spring容器归纳(四)重要
- 存储过程语法及实例
- ubuntu openvpn服务器安装
- 30. Substring with Concatenation of All Words
- python爬虫基础之request设置问题
- Java环境变量的设置