nowcoder meeting（树的直径）

题目：https://ac.nowcoder.com/acm/contest/884/A

题意：树上指定点集中的任两点的最大距离。

思路：树的直径，bfs时候判断一下当前点是否是给定点集中的点即可。

代码：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
typedef pair<int, int> P;
const int maxn = 2e5+5;
 
struct Edge {
    int to, nxt;
    bool flag;
} edge[maxn];
int n, m, head[maxn], num_edge, a[maxn], vis[maxn], vis0[maxn], ans;
void addedge(int u, int v) {
    edge[++num_edge].to = v;
    edge[num_edge].nxt = head[u];
    head[u] = num_edge;
}
int bfs(int s){
    memset(vis, 0, sizeof vis);
    queue<P>que; int u; ans = 0;
    while(que.size()) que.pop();
    que.push(P(s, 0)); vis[s] = 1;
    while(que.size()){
        P now = que.front(); que.pop();
        if(vis0[now.first] && now.second > ans) u = now.first, ans = now.second;
        for(int i=head[now.first]; ~i; i=edge[i].nxt){
            int v = edge[i].to;
            if(vis[v] == 0) {
                que.push(P(v, now.second+1)), vis[v] = 1;
            }
        }
    }
    return u;
}
int main()
{
    scanf("%d%d", &n, &m);
    memset(head, -1, sizeof(head));
    int u, v;
    for(int i=1; i<n; i++) {
        scanf("%d%d", &u, &v);
        addedge(u, v);
        addedge(v, u);
    }
    for(int i=1; i<=m; i++) scanf("%d", &a[i]), vis0[a[i]] = 1;
    u = bfs(a[1]);
    //cout << u << endl;
    bfs(u);
    cout << (ans+1)/2 << endl;
}