LCA练习题

poj1330

题意：求祖先，解释了啥是LCA。
想法：模板。

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
#define M 100009
int f[M],in[M],ancestor[M];
vector<int> tree[M],query[M];
int t,n,a,b,root,qa,qb;
bool vis[M];
int find(int x)
{
    return x == f[x] ? f[x] : f[x] = find(f[x]);
}
int uni(int x,int y)
{
    x = find(x);
    y = find(y);
    if(x != y) f[x] = y;
}
void init()
{
    for(int i = 0; i <= n; i++)
    {
        vis[i] = false;
        tree[i].clear();
        query[i].clear();
        in[i] = 0;
        f[i] = i;
    }
}
void tarjan(int x)
{
    for(int i = 0; i < tree[x].size(); i++)
    {
        int v = tree[x][i];
        tarjan(v);  //先处理子树
        uni(x,v); //将儿子节点的集合和父亲节点的集合合并
        ancestor[find(x)] = x; //将该节点所在集合的代表的祖先设置为x
    }
    vis[x] = true;
    for(int i = 0; i < query[x].size(); i++)
    {
        int v = query[x][i];
        if(vis[v])
        {
            printf("%d\n",ancestor[find(v)]);
        }
    }
}
int main()
{
    while(scanf("%d",&t) == 1)
    {
        while(t--)
        {
            scanf("%d",&n);
            init();
            for(int i = 0; i < n - 1; i++)
            {
                int a,b;
                scanf("%d %d",&a,&b);
                tree[a].push_ba