【TJOI2016&&HEOI2016】树

Description

Solution

第一眼的链剖

维护重链上打过标记的点的下标的最大值就好了。

倒着做并查集也可以

Code

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define rep(i,a) for(i=first[a];i;i=next[i])
using namespace std;
const int maxn=100007;
int i,j,k,l,n,m,ans;
int first[maxn*2],next[maxn*2],last[maxn*2],top[maxn],deep[maxn],num,w[maxn],son[maxn];
int size[maxn],tot,p[maxn],f[maxn],a[maxn];
struct node{
    int sum,mx;
}t[maxn*3];
char s[10];
void add(int x,int y){
    last[++num]=y;next[num]=first[x];first[x]=num;
}
void dfs(int x,int y){
    int i,k=0;
    deep[x]=deep[y]+1;size[x]=1;f[x]=y;
    rep(i,x){
        if(last[i]!=y){
            dfs(last[i],x);
            size[x]+=size[last[i]];
            if(size[last[i]]>k){k=size[last[i]],son[x]=last[i];}
        }
    }
}
void dfs1(int x,int y){
    int i;
    top[x]=y;w[x]=++tot;p[tot]=x;
    if(!son[x])return;
    dfs1(son[x],y);
    rep(i,x)if(last[i]!=f[x]&&last[i]!=son[x])dfs1(last[i],last[i]);    
}
void build(int x,int l,int r){
    if(l==r){t[x].mx=1;return;}
    int mid=(l+r)/2;
    build(x*2,l,mid);build(x*2+1,mid+1,r);
    t[x].mx=max(t[x*2].mx,t[x*2+1].mx);
}
void find(int x,int l,int r,int y,int z){
    if(l==y&&r==z){
        ans=max(ans,t[x].mx);return;
    }
    int mid=(l+r)/2;
    if(z<=mid)find(x*2,l,mid,y,z);
    else if(y>mid)find(x*2+1,mid+1,r,y,z);
    else{
        find(x*2,l,mid,y,mid);find(x*2+1,mid+1,r,mid+1,z);
    }
}
void findma(int x,int y){
    int t1=top[x],t2=top[y];
    while(t1!=t2){
        if(deep[t1]<deep[t2]){
            swap(t1,t2),swap(x,y);
        }
        find(1,1,n,w[t1],w[x]);
        x=f[t1],t1=top[x];
    }
    if(deep[x]<deep[y])swap(x,y);
    find(1,1,n,w[y],w[x]);
}
void change(int x,int l,int r,int y,int z){
    if(l==r){t[x].mx=z;return;}
    int mid=(l+r)/2;
    if(y<=mid)change(x*2,l,mid,y,z);
    else change(x*2+1,mid+1,r,y,z);
    t[x].mx=max(t[x*2].mx,t[x*2+1].mx);
}
int main(){
    scanf("%d%d",&n,&m);
    fo(i,1,n-1){
        scanf("%d%d",&k,&l);
        add(k,l);add(l,k);
    }
    dfs(1,0);
    dfs1(1,1);fo(i,1,n)a[i]=1;
    build(1,1,n);
    fo(i,1,m){
        scanf("%s%d",s,&k);
        if(s[0]=='Q'){
            ans=-0x7fffffff;findma(1,k);
            printf("%d\n",ans);
        }
        else{
            a[k]=k;
            change(1,1,n,w[k],k);
        }
    }
}