CF 1009F - Dominant Indices 树上启发式合并

题意：

给你一颗有根树，定义每个节点的答案为i，当i是他子树中所有与他的距离中，数量最多的最小距离。

题解：

树上启发式合并。

记录深度的次数最大值即可。

代码：

#include <bits/stdc++.h>
#ifdef LOCAL
#define debug(x) cout<<#x<<" = "<<(x)<<endl;
#else
#define debug(x) 1;
#endif

#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define lson id<<1,l,mid
#define rson id<<1|1,mid+1,r
#define lowbit(x) x&-x
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define fir first
#define sec second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const int MOD = 1e9 + 7;
const double PI = acos (-1.);
const double eps = 1e-10;
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 1e6 + 5;

int n;
vector <int> G[MAXN];
int siz[MAXN], son[MAXN];
int dep[MAXN];

void pre_dfs (int now, int par, int d) {
    siz[now] = 1;
    dep[now] = d;
    for (int i :G[now]) {
        if (i == par) continue;
        pre_dfs(i, now, d + 1);
        siz[now] += siz[i];
        if (siz[i] > siz[son[now]]) son[now] = i;
    }
}

int maxn, pos;
int cnt[MAXN];
int skip;

void cal (int now, int par) {
    cnt[dep[now]]++;
    if (cnt[dep[now]] > maxn) {
        maxn = cnt[dep[now]];
        pos = dep[now];
    } else if (cnt[dep[now]] == maxn && pos > dep[now]) pos = dep[now];
    for (int i : G[now]) {
        if (i == par || i == skip) continue;
        cal(i, now);
    }
}

void del (int now, int par) {
    cnt[dep[now]]--;
    for (int i : G[now]) {
        if (i == par) continue;
        del(i, now);
    }
}

int ans[MAXN];

void dfs (int now, int par, int kep) {
    for (int i : G[now]) {
        if (i == par || i == son[now]) continue;
        dfs(i, now, 0);
    }
    if (son[now]) dfs(son[now], now, 1), skip = son[now];
    cal(now, par);
    ans[now] = pos - dep[now];
    if (!kep) {
        del(now, par);
        maxn = pos = 0;
    }
}



int main() {
#ifdef LOCAL
    freopen ("input.txt", "r", stdin);
#endif
    scanf ("%d", &n);
    for (int i = 1; i < n; i++) {
        int x, y;
        scanf ("%d %d", &x, &y);
        G[x].pb(y);
        G[y].pb(x);
    }
    pre_dfs(1, 0, 0);
    dfs(1, 0, 1);
    for (int i = 1; i <= n; i++) printf ("%d\n", ans[i]);
    return 0;
}