洛谷P4281 [AHOI2008]紧急集合 / 聚会 树剖+LCA

---

洛谷P4281 [AHOI2008]紧急集合 / 聚会

---

标签

• 树链剖分
• LCA

---

简明题意

• 给一棵树，有多组询问，每组询问会给你3个点，让你求树上某一点x，使得x到所给三个点的距离总和最短

---

思路

• 容易发现，3个点相互之间的LCA中，取深度最深的那个，就是要集结的点，从这一点出发到三个点的距离之和最短

---

注意事项

• 求树上两点u、v的距离时，如果用深度求，需要分类讨论，讨论他们是否再同一条链上，不在同一条链上时还需要求他们的LCA

---

总结

• 无

---

AC代码

#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;

const int maxn = 5e5 + 10;

int n, m;
vector<int> g[maxn];

int dep[maxn], siz[maxn], son[maxn], fa[maxn];
void dfs1(int u, int f, int deep)
{
   fa[u] = f;
   dep[u] = deep;
   siz[u] = 1;

   int max_son = -1;
   for (auto& v : g[u])
   	if (v != f)
   	{
   		dfs1(v, u, deep + 1);
   		siz[u] += siz[v];
   		if (siz[v] > max_son)
   			max_son = siz[v], son[u] = v;
   	}
}

int id[maxn], cnt, top[maxn];
void dfs2(int u, int topf)
{
   id[u] = ++cnt;
   top[u] = topf;

   if (son[u])
   {
   	dfs2(son[u], topf);
   	for (auto& v : g[u])
   		if (v != fa[u] && v != son[u])
   			dfs2(v, v);
   }
}

int LCA(int u, int v)
{
   while (top[u] != top[v])
   {
   	if (dep[top[v]] < dep[top[u]]) swap(u, v);
   	v = fa[top[v]];
   }
   return dep[u] < dep[v] ? u : v;
}

int ask_path(int u, int v)
{
   int cnt = 0;
   while (top[u] != top[v])
   {
   	if (dep[top[v]] < dep[top[u]]) swap(u, v);
   	cnt += id[v] - id[top[v]] + 1;
   	v = fa[top[v]];
   }
   return cnt + abs(id[u] - id[v]);
}

int cal(int o, int x, int y, int z)
{
   return ask_path(o, x) + ask_path(o, y) + ask_path(o, z);
}

void solve()
{
   scanf("%d%d", &n, &m);
   for (int i = 1; i < n; i++)
   {
   	int u, v;
   	scanf("%d%d", &u, &v);

   	g[u].push_back(v), g[v].push_back(u);
   }

   dfs1(1, 1, 1);
   dfs2(1, 1);

   while (m--)
   {
   	int x, y, z;
   	scanf("%d%d%d", &x, &y, &z);

   	int k = LCA(x, y), t;
   	if (dep[k] < dep[t = LCA(y, z)]) k = t;
   	if (dep[k] < dep[t = LCA(x, z)]) k = t;

   	printf("%d %d\n", k, cal(k, x, y, z));
   }
}

int main()
{
   freopen("Testin.txt", "r", stdin);
   solve();
   return 0;
}

---

双倍经验

• 无