CF 600E(Lomsat gelral-dfs)

一棵树n (1 ≤ n ≤ 300 000)个节点，已知点权$c_i≤ n$，根为1
对于每个节点，求出对应子树中，出现次数最多（或之一）的点权的和

用一个map暴力存，每次从最大那个合并

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define SZ(x) ((int)(x).size())
typedef long long ll;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
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;
} 
#define MAXN (100000+10)
int n,a[MAXN];
int high[MAXN]={0};
ll sum[MAXN]={0};
struct Node{
    map<int,int> g;
}rt[MAXN];
int sz[MAXN]={0},mpsz[MAXN]={0};
vi e[MAXN];
void insert(int x,int i,int k){
    if (rt[x].g.count(i)) rt[x].g[i]+=k;
    else rt[x].g[i]=k;

    int ma=rt[x].g[i];
    if (high[x]<ma) {
        high[x]=ma;sum[x]=i;
    } else if (high[x]==ma) sum[x]+=i;
}
void dfs(int x,int f)
{
    for(auto v:e[x]) {
        if (v==f) continue;
        dfs(v,x); sz[x]+=sz[v];
    }
    sz[x]++; 
    insert(x,a[x],1);

    int m=SZ(e[x]);
    if ((m==1&&f!=0)||n==1) {
        sum[x]=a[x];            
        mpsz[x]=1;  
        return;
    }   

    int p=x;
    for(auto v:e[x]) if (v!=f) {
        if (mpsz[v]>mpsz[p]) p=v;
    }

    swap(rt[x].g,rt[p].g);
    high[x]=high[p];
    sum[x]=sum[p];
    for(auto v:e[x]) if (v!=f)  {
        for(auto v2:rt[v].g) {
            insert(x,v2.fi,v2.se);
        }
    }   


    mpsz[x]=SZ(rt[x].g);    
}
int main()
{
//  freopen("CF600E.in","r",stdin);
//  freopen(".out","w",stdout);

    n=read();
    For(i,n) a[i]=read();
    For(i,n-1) {
        int u=read(),v=read();
        e[u].pb(v);
        e[v].pb(u);
    }
    dfs(1,0);
    For(i,n) {
        cout<<sum[i]<<' ';
    }
    cout<<endl;
    return 0;
}