树的直径

最新推荐文章于 2022-01-09 22:58:59 发布

亦往沧劫

最新推荐文章于 2022-01-09 22:58:59 发布

阅读量343

点赞数 2

分类专栏：树文章标签：树

本文链接：https://blog.csdn.net/UltraSurreal/article/details/81317210

版权

树专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Cow Marathon

Time Limit: 2000MS		Memory Limit: 30000K
Total Submissions: 6224		Accepted: 2989
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

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.

首先，对任意一个点进行BFS，找到离他最远的点，再对这个最远点BFS，找到最远距离。

#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
const int maxn=100020;
using namespace std;
int dis[maxn],ans;
bool vis[maxn];
vector<pair<int,int> > V[maxn];
int bfs(int x)
{
    memset(dis,0,sizeof(dis));
    memset(vis,0,sizeof(vis));
    queue<int>Q;
    Q.push(x);
    vis[x]=1;
    int point=0;
    while(!Q.empty())
    {
        int F=Q.front();
        Q.pop();
        if(dis[F]>ans)
        {
            ans=dis[F];
            point=F;
        }
        pair<int,int>t;
        for(int i=0;i<V[F].size();i++)
        {
             t=V[F][i];
             if(vis[t.first]==0)
             {
                vis[t.first]=1;
                dis[t.first]=dis[F]+t.second;
                Q.push(t.first);
             }
        }
    }
    return point;
}
int main()
{
    int N,M,x,y,z;
    char dir;
    while(cin>>N>>M)
    {
        for(int i=0;i<M;i++)
        {
            cin>>x>>y>>z>>dir;
            V[x].push_back(make_pair(y,z));
            V[y].push_back(make_pair(x,z));
        }
        ans=0;
        int point=bfs(1);
        ans=0;
        bfs(point);
        cout<<ans<<endl;
        for(int i=0;i<=N;i++)
            V[i].clear();
    }
    return 0;
}