HYSBZ 4551树

那个就是，一开始要dfs一遍，把那个给每个点的深度，要记录一下，然后就是来像普通的线段树一样建树，更新，查找，就这样就行了。这会写的是左闭右开。

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long LL;

const int MaxN = 1e5;
int n , m ;
int all , last[MaxN + 5] , pre[2*MaxN + 5], other[2*MaxN + 5];
int l[MaxN + 5] , r[MaxN + 5] ,tot , dep[MaxN + 5];

int Judge(int x , int y)
{
    if(x == 0) return y;
    if(y == 0) return x;
    if(dep[x] > dep[y]) return x;
    return y;
}
struct SegMentTree{
    int tot;
    struct node{
        int left , right , flag;
    } tree[MaxN << 2 + 5];
    void Buildtree(int x , int l , int r)
    {
        tree[x].left = l,tree[x].right = r,tree[x].flag = 0;
        if(l == r - 1) return ;
        int mid = (l + r) >> 1;
        Buildtree(x << 1 , l , mid);
        Buildtree(x << 1 | 1 , mid , r);
    }
    void Init(int n)
    {
        tot = 1 ;
        while(tot <= n ) tot <<= 1;
        Buildtree(1 , 1 , tot + 1);
    }
    void Push_Down(int x)
    {
        if(tree[x].flag)
        {
            tree[x << 1].flag = Judge(tree[x << 1].flag , tree[x ].flag);
            tree[x << 1 | 1].flag = Judge(tree[x << 1 | 1].flag , tree[x ].flag);
            tree[x].flag = 0;
        }
    }
    void Add_Seg(int x , int l , int r , int t)
    {
        if(tree[x].left == l && tree[x].right == r)
        {
            tree[x].flag = Judge(tree[x].flag , t);
            return ;
        }
        Push_Down(x);
        int mid = (tree[x].left + tree[x].right) >> 1;
        if(r <= mid) Add_Seg(x << 1 , l , r , t);
        else if(l >= mid) Add_Seg(x << 1 | 1 , l , r , t);
        else Add_Seg(x << 1 , l , mid , t) , Add_Seg(x << 1 | 1 , mid , r , t);
    }

    int Ask(int x , int p)
    {
        if(tree[x].left == tree[x].right - 1) return tree[x].flag;
        Push_Down(x);
        int mid = (tree[x].left + tree[x].right) >> 1;
        if(p < mid) return Ask(x << 1 ,p);
        else return Ask(x << 1 | 1 , p);
    }
}P;

void Build(int x , int y)
{
    pre[++all] = last[x];//pre上一条边
    last[x] = all;//x的最后一条边
    other[all] = y; //all这条边的另一个点
}

void Dfs(int x, int y)//y father x son
{
    int ed , dr;
    l[x] = ++tot;
    dep[x] = dep[y] + 1;//深度
    ed = last[x];//当前边
    while(ed != -1){//到头了
        dr = other[ed];
        if(dr != y) Dfs(dr , x);//别让他回去了
        ed = pre[ed];//这条边的上一条边
    }
    r[x] = tot;
}

int main()
{
    while(~scanf("%d%d",&n , &m)){
        all = -1;
        memset(last , - 1 , sizeof(last));
        for(int i = 1 ; i <= n - 1 ; i++){
            int u , v;
            scanf("%d%d", &u , &v);
            Build(u , v);
            Build(v , u);
        }
        tot = 0 , dep[0] = 0;
        Dfs(1 , 0);
        P.Init(n);
        P.Add_Seg(1 , l[1] , r[1] + 1 , 1);
        for(int i = 1 ; i <= m ; i++){
            char c ;
            int x ;
            scanf(" %c",&c);
            scanf("%d",&x);
            if(c == 'C') P.Add_Seg(1 , l[x] , r[x] + 1 , x);//左闭右开
            else printf("%d\n",P.Ask(1, l[x]));
        }
    }
}