题目链接:https://ac.nowcoder.com/acm/contest/884/A
题意:一个树,k个人在某些位置,问在哪个点开会,所以人都到达的时间最小
题解:这种问题,就像是套路一样,对于每一个点来说,最远来的要么是子节点的贡献,要么是父节点过来的,所以我们先dfs保存下,每个节点子树中到这个节点的最远的和次远的,然后第二遍dfs就处理下每个节点通过父节点来更新的距离,如果这个分支是父亲节点得到的最远的,那么就从父亲节点远元的和上面跟新过来的取个最大值来更新。因为只有部分点有人,所以更新的时候要注意这点。
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, k;
struct edge {
int to, nex;
}e[N * 2];
int head[N], len;
int dp[N][2], pre[N];
int id[N][2];
int vis[N];
void add(int x, int y) {
e[len].to = y;
e[len].nex = head[x];
head[x] = len++;
}
void dfs(int u, int fa) {
pre[u] = -1;
dp[u][0] = dp[u][1] = -1;
id[u][0] = id[u][1] = -1;
if(vis[u] == 1) {
dp[u][0] = 0;
id[u][0] = u;
}
int to;
// cout << u << endl;
for(int i = head[u]; i != -1; i = e[i].nex) {
to = e[i].to;
if(to == fa) continue;
dfs(to, u);
if(dp[to][0] == -1) continue;
if(dp[u][0] == -1 || dp[to][0] + 1 > dp[u][0]) {
dp[u][1] = dp[u][0];
id[u][1] = id[u][0];
dp[u][0] = dp[to][0] + 1;
id[u][0] = to;
} else if(dp[u][1] == -1 || dp[to][0] + 1 > dp[u][1]) {
dp[u][1] = dp[to][0] + 1;
id[u][1] = to;
}
}
// cout << u << " " << dp[u][0] << " " << dp[u][1] << endl;
}
int ans;
void dfs1(int u, int fa) {
int to, cnt;
for(int i = head[u]; i != -1; i = e[i].nex) {
to = e[i].to;
if(to == fa) continue;
if(id[u][0] != -1) {
if(id[u][0] != to) {
cnt = dp[u][0];
if(pre[u] != -1) cnt = max(cnt, pre[u]);
pre[to] = cnt + 1;
} else {
cnt = -1;
if(id[u][1] != -1) cnt = dp[u][1];
if(pre[u] != -1) {
if(cnt == -1 || pre[u] > cnt)
cnt = pre[u];
}
if(cnt != -1)
pre[to] = cnt + 1;
}
} else {
if(pre[u] != -1)
pre[to] = pre[u] + 1;
}
dfs1(to, u);
}
// cout << u << " " << dp[u][0] << " " << pre[u] << endl;
cnt = 0;
if(dp[u][0] != -1) cnt = max(cnt , dp[u][0]);
if(pre[u] != -1) cnt = max(cnt , pre[u]);
ans = min(ans, cnt);
}
int main() {
int x, y, z;
while(~scanf("%d %d", &n, &k)) {
len = 0;
for(int i = 1; i <= n; i++) head[i] = -1, vis[i] = 0;
for(int i = 1; i < n; i++) {
scanf("%d %d", &x, &y);
add(x, y);
add(y, x);
}
for(int i = 1; i <= k; i++) {
scanf("%d", &x);
vis[x] = 1;
}
ans = n;
dfs(1, 0);
dfs1(1, 0);
printf("%d\n", ans);
}
return 0;
}