【树的直径】bzoj 1509 逃学的小孩

题目链接：http://www.lydsy.com/JudgeOnline/problem.php?id=1509
题目大意：给你一棵树，找出三个点A,B,C，使min(dist[A->B],dist[A->C])+dist[B->C]最大

首先dist[B->C]不用取min，所以dist[B->C]应该为树的直径，然后找A点，只需要两遍搜索找出每个点到B的距离和到C的距离，然后在所有的点的min里取个max即可……

#include <iostream>
#include <cstdio>
#include <cstring>
#define ll long long
using namespace std;
struct Link
{
    int s,t,next;
    ll c;
}l[500000];
int g[300000];
ll dist[300000];
ll dist2[300000];
bool b[300000];
int p;
ll maxn;

void dfs(int x)
{
    if(dist[x] > maxn)
    {
        maxn = dist[x];
        p = x;
    }
    int w = g[x];
    while(w)
    {
        if(!dist[l[w].t])
        {
            dist[l[w].t] = dist[x] + l[w].c;
            dfs(l[w].t);
        }
        w = l[w].next;
    }
    return ;
}

void dfs2(int x)
{
    int w = g[x];
    while(w)
    {
        if(!dist2[l[w].t])
        {
            dist2[l[w].t] = dist2[x] + l[w].c;
            dfs2(l[w].t);
        }
        w = l[w].next;
    }
    return ;
}

void Add_Link(int s,int t,ll c,int x)
{
    l[x].s = s;
    l[x].t = t;
    l[x].c = c;
    l[x].next = g[s];
    g[s] = x;
    return ;
}

int main()
{
    int n,m,s,t;
    ll c;
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= m;i ++)
    {
        scanf("%d",&s);
        scanf("%d",&t);
        scanf("%lld",&c);
        Add_Link(s,t,c,i);
        Add_Link(t,s,c,i+m);
    }
    dist[1] = 1;
    dfs(1);
    memset(dist,0,sizeof(dist));
    maxn = 0;
    dist[p] = 1;
    dfs(p);
    maxn --;
    dist2[p] = 1;
    dfs2(p);
    ll ans = 0;
    for(int i = 1;i <= n;i ++)
        ans = max(ans,min(dist[i]-1,dist2[i]-1));
    cout << maxn + ans << endl;
    return 0;
}