POJ1985 Cow Marathon 树的直径

Albafica

墨衍会员 · AI 创作全网分发码龄15年

关注

原创最新推荐文章于 2020-12-03 20:07:10 发布 1.3k 阅读 AI 写同款· GEO 优化 ›

AI权益加码！Claude Code、Cursor等20+工具免费用！购周边限时加赠Coding Plan Lite，畅享主流AI工具！学习进阶更高效！阅读详情

求一棵树的直径。

方法：

随便选一个点当做root，开始DFS找到最远的一个点，这个点一定是树直径中的一个端点（严格树，不存在环）

然后再把刚才找到的点作为ROOT 第二遍DFS，这次找到的最远的距离，就是树的直径。

Cow Marathon

Time Limit: 2000MS		Memory Limit: 30000K
Total Submissions: 2963		Accepted: 1484
Case 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

Sample Output

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

#define MAXN  500000

struct edge
{
    int to,dis,next;
}e[9999999];

int head[MAXN],en;
int dis[MAXN];

void add(int u,int v ,int w)
{
    e[en].to=v;
    e[en].dis=w;
    e[en].next=head[u];
    head[u]=en++;
}

void dfs(int f,int u,int d)
{
    dis[u]=d;
    for(int i=head[u];i!=-1;i=e[i].next)
        if(e[i].to!=f)
            dfs(u,e[i].to,d+e[i].dis);
}

int u,v,c;
int n,m;
char s[20];
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(head,-1,sizeof(head));
        en=0;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d%s",&u,&v,&c,s);
            add(u,v,c);
            add(v,u,c);
        }
        dfs(0,1,0);
        int maxs,tag;
        maxs=-1;tag=0;
        for(int i=1;i<=n;i++)
        {
            if(maxs<dis[i])
            {
                maxs=dis[i];
                tag=i;
            }
        }
        dfs(0,tag,0);
        maxs=-1;
        for(int i=1;i<=n;i++)
            maxs=max(maxs,dis[i]);
        printf("%d\n",maxs);
    }
    return 0;
}

收录于