bzoj 3631

链剖，应该用这道来入门啊= =，只顾下传标记就行。。

#include<bits/stdc++.h>
#define inc(i,l,r) for(i=l;i<=r;i++)
#define dec(i,l,r) for(i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define inf 1e9
#define ll long long
#define succ(x) (1<<x)
#define NM 300000+5
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
struct info{
    int z,s;
}T[8*NM];
struct edge{
    int t;
    edge *next;
}e[2*NM],*h[NM],*p=e;
int f[NM],id[NM],_id[NM],son[NM],d[NM],size[NM],top[NM],TOP,tot;
int n,m,_x,_y,l,r,a[NM],_v;
void add(int x,int y){
    p->t=y;p->next=h[x];h[x]=p;p++;
}
void dfs1(int x){
    link(x)
    if(!f[j->t]){
        f[j->t]=x;
        d[j->t]=d[x]+1;
        dfs1(j->t);
        size[x]+=size[j->t];
        if(size[j->t]>size[son[x]])son[x]=j->t;
    }
    size[x]++;
}
void dfs2(int x){
    top[x]=TOP;id[x]=++tot;_id[tot]=x;
    if(son[x])dfs2(son[x]);
    link(x)
    if(!top[j->t])dfs2(TOP=j->t);
}
void pushdown(int i){
    if(T[i].z){
        T[i<<1].s+=T[i].z;T[i<<1|1].s+=T[i].z;
        T[i<<1].z+=T[i].z;T[i<<1|1].z+=T[i].z;
        T[i].z=0;
    }
}
void add(int i,int x,int y){
    int t=x+y>>1;
    if(l<=x&&y<=r){
        T[i].z+=_v;T[i].s+=_v;
        return;
    }
    if(r<x||y<l)return;
    pushdown(i);
    add(i<<1,x,t);add(i<<1|1,t+1,y);
}
void ans(int i,int x,int y){
    int t=x+y>>1;
    if(x==y){
        a[_id[x]]=T[i].s;
        return;
    }
    pushdown(i);
    ans(i<<1,x,t);ans(i<<1|1,t+1,y);
}
int main(){
    int i;
    n=read();
    inc(i,1,n)a[i]=read();
    inc(i,1,n-1){
        _x=read();_y=read();
        add(_x,_y);add(_y,_x);
    }
    f[1]=1;
    dfs1(1);
    dfs2(TOP=1);
    inc(i,1,n-1){
        _x=a[i];_y=a[i+1];
        _v=1;
        while(top[_x]!=top[_y]){
            if(d[top[_x]]<d[top[_y]])swap(_x,_y);
            l=id[top[_x]];r=id[_x];
            add(1,1,n);
            _x=f[top[_x]];
        }
        if(d[_x]>d[_y])swap(_x,_y);
        l=id[_x];r=id[_y];_v=1;
        add(1,1,n);
        l=r=id[a[i+1]];_v=-1;
        add(1,1,n);
//        ans(1,1,n);printf("
");
    }
    ans(1,1,n);
    inc(i,1,n)printf("%d
",a[i]);
    return 0;
}