CodeForces 600E Lomsat gelral 树上启发式合并

#include<bits/stdc++.h>
using namespace std;
#define rep(x,y,z) for(int (x)=(y);(x)<(z);x++)
#define mst(x,y) memset(x,y,sizeof(x))
#define ll long long
const int maxn=1e5+10;
const int maxk=1e7+10;
#define pii pair<int,int> 
#define piii pair<int,pii>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
#define debug cout<<"YES"<<endl;
int gcd(int x,int y){return y?gcd(y,x%y):x;}

int n,tot,col[maxn],head[maxn];
struct node{
    int u,nxt;
}edge[maxn<<1];
void init(){
    mst(head,-1),tot=0;
}
void addedge(int u,int v){
    edge[tot]=node{v,head[u]};
    head[u]=tot++;
}
int son[maxn],sz[maxn];///找重儿子
void dfs(int u,int f){
    sz[u]=1;
    for(int i=head[u];~i;i=edge[i].nxt){
        int v=edge[i].u;
        if(v==f) continue;
        dfs(v,u);
        sz[u]+=sz[v];
        if(sz[v]>sz[son[u]]) son[u]=v;
    }
}

int flag,maxc,cnt[maxn];
long long ans[maxn],sum;
void count(int u,int f,int v){
    cnt[col[u]]+=v;
    if(cnt[col[u]]==maxc){
        sum+=col[u];
    }else if(cnt[col[u]]>maxc){
        sum=col[u];
        maxc=cnt[sum];
    }
    for(int i=head[u];~i;i=edge[i].nxt){
        int vv=edge[i].u;
        if(vv==f||vv==flag) continue;
        count(vv,u,v);
    }
}
void dfs(int u,int f,int keep){
    for(int i=head[u];~i;i=edge[i].nxt){
        int v=edge[i].u;
        if(v==son[u]||v==f) continue;
        dfs(v,u,0);
    }
    if(son[u]){
        dfs(son[u],u,1);
        flag=son[u];
    }
    count(u,f,1);
    flag=0,ans[u]=sum;
    if(!keep){
        count(u,f,-1);
        sum=maxc=0;
    }
}
int u,v;
int main(){
    ios::sync_with_stdio(false);
    init();
    cin>>n;
    rep(i,1,n+1) cin>>col[i];
    rep(i,1,n){
        cin>>u>>v;
        addedge(u,v);
        addedge(v,u);
    }
    dfs(1,0);
    dfs(1,0,1);
    rep(i,1,n+1) cout<<ans[i]<<" ";
    return 0;
}