[SDOI 2013] 直径

[题目链接]

https://www.lydsy.com/JudgeOnline/problem.php?id=3124

[算法]

树的直径

[代码]

#include<bits/stdc++.h>
using namespace std;
#define MAXN 200010

struct edge
{
        int to,w,nxt;
} e[MAXN << ];

int i,n,s,t,cnt,tmp,tot,u,v,w,l,r;
long long mx;
int path[MAXN],head[MAXN],pre[MAXN];
long long dist[MAXN];
bool visited[MAXN];

inline void addedge(int u,int v,int w)
{
        tot++;
        e[tot] = (edge){v,w,head[u]};
        head[u] = tot;
}
inline int bfs(int s)
{
        int i,u,v,w,l,r,pos;
        static int q[MAXN];
        static bool visited[MAXN];
        for (i = ; i <= n; i++) visited[i] = false;
        q[l = r = ] = s;
        dist[s] = ;
        pre[s] = ;
        visited[s] = true;
        while (l <= r)
        {
                u = q[l];
                l++;
                for (i = head[u]; i; i = e[i].nxt)
                {
                        v = e[i].to;
                        w = e[i].w;
                        if (!visited[v])
                        {
                                visited[v] = true;
                                dist[v] = (long long)dist[u] + w;
                                pre[v] = u;
                                q[++r] = v;
                        }
                }
        }
        pos = ;
        for (i = ; i <= n; i++)
        {
                if (dist[i] > dist[pos])
                        pos = i;
        }
        return pos;
}
inline void dfs(int u,int fa,long long sum)
{
        int i,v,w;
        mx = max(mx,sum);
        for (i = head[u]; i; i = e[i].nxt)
        {
                v = e[i].to;
                w = e[i].w;
                if (v != fa && !visited[v]) dfs(v,u,sum + w);
        }
}

int main()
{

        scanf("%d",&n);
        for (i = ; i < n; i++)
        {
                scanf("%d%d%d",&u,&v,&w);
                addedge(u,v,w);
                addedge(v,u,w);
        }
        s = bfs();
        t = bfs(s);
        printf("%lld\n",dist[t]);
        tmp = t;
        while (tmp != )
        {
                path[++cnt] = tmp;
                tmp = pre[tmp];
                visited[tmp] = true;
        }
        reverse(path + ,path + cnt + );
        l = ,r = cnt;
        for (i = cnt; i >= ; i--)
        {
                mx = ;
                dfs(path[i],,);
                if (!mx) continue;
                if (mx == dist[t] - dist[path[i]]) r = i;
                if (mx == dist[path[i]])
                {
                        l = i;
                        break;
                }
        }
        printf("%d\n",r - l);

        return ;

}