树的直径的定义:一棵树上最远的两个节点间的路径长度。
方法一:从任意一点u出发,通过dfs(或bfs)找到距离该点最远的点p,再从p通过dfs(或bfs)找到距离该点最远的点q, 则p与q之间的距离即为树的直径。
缺点:无法处理存在负权边的情况。
完整代码:
#include <iostream>
#include <cstring>
using namespace std;
const int N = 1e5 + 10, M = 2e5 + 10;
int n;
int h[N], e[M], w[M], ne[M], idx;
int d[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++ ;
}
void dfs(int u, int fa)
{
for (int i = h[u]; ~i; i = ne[i])
{
int j = e[i];
if (j == fa) continue;
d[j] = d[u] + w[i];
dfs(j, u);
}
}
int main()
{
scanf("%d", &n);
memset(h, -1, sizeof h);
for (int i = 1; i <= n - 1; i ++ )
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
add(a, b, c), add(b, a, c);
}
dfs(1, -1);
int p = 0;
for (int i = 1; i <= n; i ++ )
if (d[i] > d[p])
p = i;
memset(d, 0, sizeof d);
dfs(p, -1);
int maxd = -1e9;
for (int i = 1; i <= n; i ++ ) maxd = max(maxd, d[i]);
printf("%d\n", maxd);
return 0;
}
第二种方法:枚举所有链,求最长的链的长度。
以dist[i]表示以i为根节点的子树中, 从i出发能够到达的最远节点的距离,
则经过u的最大链长 = max{dist[i] + w[u][i] + w[u][j] + dist[j]};
完整代码
#include <iostream>
#include <cstring>
#include <algorithm>
typedef long long LL;
using namespace std;
const int N = 5e5 + 10, M = 1e6 + 10;
int n;
int maxd;
int h[N], e[M], w[M], ne[M], idx;
int d[N];
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++ ;
}
void dfs(int u, int fa)
{
for (int i = h[u]; ~i; i = ne[i])
{
int j = e[i];
if (j == fa) continue;
dfs(j, u);
maxd = max(maxd, d[u] + w[i] + d[j]);
d[u] = max(d[u], d[j] + w[i]);
}
}
int main()
{
scanf("%d", &n);
memset(h, -1, sizeof h);
for (int i = 1; i <= n - 1; i ++ )
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
add(a, b, c), add(b, a, c);
}
dfs(1, -1);
printf("%d\n", maxd);
return 0;
}