Wannafly挑战赛1 C-MMSET2 LCA

传送门
解法虚树或者LCA
思路：对于每次找点集中的每个点与其他点最大距离的最小值。最后答案是((点集的直径+1)/2)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
//#pragma comment(linker, "/STACK:102400000,102400000") //不需要申请系统栈
const int N = 300005;
const int M = 25;
const int inf = 0x3f3f3f3f;
int b[1000005];
int dp[2*N][M];  //这个数组记得开到2*N，因为遍历后序列长度为2*n-1
bool vis[N];
struct edge
{
    int u,v,w,next;
} e[2*N];
int tot,head[N];
inline void add(int u,int v,int w,int &k)
{
    e[k].u = u;
    e[k].v = v;
    e[k].w = w;
    e[k].next = head[u];
    head[u] = k++;
    u = u^v;
    v = u^v;
    u = u^v;
    e[k].u = u;
    e[k].v = v;
    e[k].w = w;
    e[k].next = head[u];
    head[u] = k++;
}
int ver[2*N],R[2*N],first[N],dir[N];
//ver:节点编号 R：深度 first：点编号位置 dir：距离
void dfs(int u,int dep)
{
    vis[u] = true;
    ver[++tot] = u;
    first[u] = tot;
    R[tot] = dep;
    for(int k=head[u]; k!=-1; k=e[k].next)
        if( !vis[e[k].v] )
        {
            int v = e[k].v, w = e[k].w;
            dir[v] = dir[u] + w;
            dfs(v,dep+1);
            ver[++tot] = u;
            R[tot] = dep;
        }
}
void ST(int n)
{
    for(int i=1; i<=n; i++)
        dp[i][0] = i;
    for(int j=1; (1<<j)<=n; j++)
    {
        for(int i=1; i+(1<<j)-1<=n; i++)
        {
            int a = dp[i][j-1], b = dp[i+(1<<(j-1))][j-1];
            dp[i][j] = R[a]<R[b]?a:b;
        }
    }
}
//中间部分是交叉的。
int RMQ(int l,int r)
{
    int k=0;
    while((1<<(k+1))<=r-l+1)
        k++;
    int a = dp[l][k], b = dp[r-(1<<k)+1][k]; //保存的是编号
    return R[a]<R[b]?a:b;
}

int LCA(int u,int v)
{
    int x = first[u], y = first[v];
    if(x > y) swap(x,y);
    int res = RMQ(x,y);
    return ver[res];
}

int main()
{
    int n;
    while(~scanf("%d", &n))
    {
        int q,num = 0;
        memset(head,-1,sizeof(head));
        memset(vis,false,sizeof(vis));
        for(int i=1; i<n; i++)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            add(u,v,1,num);
        }
        tot = 0;
        dir[1] = 0;
        dfs(1,1);
        ST(2*n-1);
        scanf("%d", &q);
        while(q--)
        {
            int m;
            scanf("%d", &m);
            int p, Max=-1;
            for(int i=1; i<=m; ++i)
            {
                scanf("%d", &b[i]);
                if(dir[b[i]]>Max)
                {
                    Max=dir[b[i]];
                    p=b[i];
                }
            }
            Max=0;
            for(int i=1;i<=m;++i)
                Max=max(Max, dir[p]+dir[b[i]]-2*dir[LCA(p, b[i])]);
                printf("%d\n", (Max+1)/2);
        }
    }
    return 0;
}