# POJ 1985 Cow Marathon(树的直径)

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 6
1 6 13 E
6 3 9 E
3 5 7 S
4 1 3 N
2 4 20 W
4 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

``` 1 #include<iostream>
2 #include<cstdio>
3 #include<cstring>
4 #include<cmath>
5 #define lli long long int
6 using namespace std;
7 const int MAXN=100001;
9 {
10     char c='+';int x=0;bool flag=0;
11     while(c<'0'||c>'9'){c=getchar();if(c=='-')flag=1;}
12     while(c>='0'&&c<='9')
13     x=(x<<1)+(x<<3)+c-48,c=getchar();
14     flag==1?n=-x:n=x;
15 }
16 struct node
17 {
18     int u,v,w,nxt;
19 }edge[MAXN];
21 int num=1;
22 int n,m;
23 void add_edge(int x,int y,int z)
24 {
25     edge[num].u=x;
26     edge[num].v=y;
27     edge[num].w=z;
30 }
31 int dp[MAXN];
32 int ans=0;
33 int ed=0;
34 void dfs(int u,int fa,int now)
35 {
36     if(now>ans)
37     {
38         ans=now;
39         ed=u;
40     }
42     {
43         if(edge[i].v!=fa)
44             dfs(edge[i].v,u,now+edge[i].w);
45     }
46 }
47 int  main()
48 {
51      for(int i=1;i<=m;i++)
52      {
53          int x,y,z;char c;
55          cin>>c;
58      }
59      dfs(1,0,0);
60      dfs(ed,0,0);
61      printf("%d",ans);
62     return 0;
63 }```

1811 篇文章115 人订阅

0 条评论

## 相关文章

1504

1202

1141

### 1081: [SCOI2005]超级格雷码

1081: [SCOI2005]超级格雷码 Time Limit: 10 Sec  Memory Limit: 162 MB Submit: 301  Solv...

2596

### Code forces 719A Vitya in the Countryside

A. Vitya in the Countryside time limit per test:1 second memory limit per test:2...

3466

1855

### LeetCode Fizz Buzz题目分析代码

Write a program that outputs the string representation of numbers from 1 to n.

741

### 深入分析Spring MVC中RequestBody与ResponseBody

在SpringMVC中，可以使用@RequestBody和@ResponseBody两个注解，分别完成请求报文到对象和对象到响应报文的转换。在Sprin...

2301

3064

1002