//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f7f7f7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define PiL pair <ll , ll>
#define PLL pair <ll , ll>
#define Pii pair <int , int>
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
const int N = 1e6+5;
int head[N] , cnt, n;
struct node
{
int next , t , w;
}edge[2 * N];
void add (int f, int t, int w)
{
edge[cnt].w = w;
edge[cnt].t = t;
edge[cnt].next = head[f];
head[f] = cnt ++;
}
int h[N], son[N];
int *dp[N], temp[N], *cur = temp;
int ans[N];
void dfs1 (int u , int fa)
{
h[u] = 1;
for (int i = head[u] ; i != -1 ; i = edge[i].next)
{
int v = edge[i].t;
if (v != fa)
{
dfs1 (v , u);
h[u] = max (h[u], h[v] + 1);
if (h[v] > h[son[u]]) son[u] = v;
}
}
}
void dfs2 (int u , int fa)
{
dp[u][0] = 1;
if (son[u])
{
dp[son[u]] = dp[u] + 1; //共享内存
dfs2(son[u], u);
ans[u] = ans[son[u]] + 1;
}
for (int i = head[u] ; i != -1 ; i = edge[i].next)
{
int v = edge[i].t;
if (v != son[u] && v != fa)
{
dp[v] = cur, cur += h[v]; // 分配内存
dfs2(v, u);
for (int j = 1 ; j <= h[v] ; j ++)
{
dp[u][j] += dp[v][j-1];
if (dp[u][j] > dp[u][ans[u]] || (dp[u][j] == dp[u][ans[u]] && j < ans[u])) ans[u] = j;
}
}
}
if (dp[u][ans[u]] == 1) ans[u] = 0;
}
int main()
{
read (n);
mem(head, -1);
for (int i = 1 ; i < n ; i ++)
{
int u , v;
read (u , v);
add (u, v, 1);
add (v, u, 1);
}
dfs1 (1 , 1);
dp[1] = cur , cur += h[1]; //分配内存
dfs2 (1 , 1);
for (int i = 1 ; i <= n ; i ++)
write (ans[i]), LF;
}
以上为长链剖分优化树形DP
//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f7f7f7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define PiL pair <ll , ll>
#define PLL pair <ll , ll>
#define Pii pair <int , int>
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
const int N = 1e6+5;
int n;
int root[N] , lc[25*N], rc[25*N], val[25*N], id[25*N], tot;
int head[N], cnt;
int ans[N];
struct node {
int t, next , w;
}edge[N * 2];
void add (int f, int t, int w)
{
edge[cnt].t = t;
edge[cnt].w = w;
edge[cnt].next = head[f];
head[f] = cnt ++;
}
int dep[N] = {1, 1};
void dfs1 (int u , int fa)
{
for (int i = head[u] ; i != -1 ; i = edge[i].next)
{
int v = edge[i].t;
if (v != fa)
{
dep[v] = dep[u] + 1;
dfs1 (v, u);
}
}
}
void push_up(int i)
{
if (val[lc[i]] >= val[rc[i]])
{
val[i] = val[lc[i]];
id[i] = id[lc[i]];
}
else
{
val[i] = val[rc[i]];
id[i] = id[rc[i]];
}
}
void insert (int &rt, int l , int r, int x , int add)
{
if (!rt) rt = ++ tot;
if (l == r)
{
id[rt] = x;
val[rt] += add;
return ;
}
int mid = (l + r) >> 1;
if (x <= mid)
insert (lc[rt], l , mid , x , add);
else
insert (rc[rt], mid + 1, r , x , add);
push_up(rt);
}
int merge (int x, int y, int l , int r)
{
if (!x) return y;
if (!y) return x;
if (l == r)
{
val[x] += val[y];
id[x] = l;
return x;
}
int mid = (l + r) >> 1;
lc[x] = merge(lc[x], lc[y], l, mid);
rc[x] = merge(rc[x], rc[y], mid+1, r);
push_up(x);
return x;
}
void dfs (int u , int fa)
{
insert (root[u], 1, n, dep[u], 1);
for (int i = head[u] ; i != -1 ; i = edge[i].next)
{
int v = edge[i].t;
if (v != fa)
{
dfs (v, u);
root[u] = merge(root[u], root[v], 1, n);
}
}
ans[u] = id[root[u]] - dep[u];
}
int main()
{
read (n);
mem(head,-1);
for (int i = 1 ; i < n; i ++)
{
int u , v;
read (u , v);
add (u , v , 1);
add (v , u , 1);
}
dfs1 (1 , 1);
dfs (1 , 1);
for (int i = 1 ; i <= n ; i ++)
write (ans[i]), LF;
}
以上为动态开点权值线段树合并
//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
const int N = 1e6 + 5;
int n , m;
vector <int> edge[N];
vector <pair<int,int> > q[N];
int ans[N], siz[N] , son[N] , dep[N];
int cnt[N], vis[N], maxCnt , maxId;
void dfs1 (int u , int fa)
{
siz[u] = 1;
for (auto v : edge[u])
{
if (v != fa)
{
dep[v] = dep[u] + 1;
dfs1 (v, u);
siz[u] += siz[v];
if (siz[son[u]] < siz[v])
son[u] = v;
}
}
}
void calc (int u , int fa, int k)
{
cnt[dep[u]] += k;
if (cnt[dep[u]] > maxCnt)
maxId = dep[u], maxCnt = cnt[dep[u]];
else if (cnt[dep[u]] == maxCnt)
maxId = min (maxId, dep[u]);
for (auto v : edge[u])
if (v != fa && !vis[v])
calc(v , u, k);
}
void dfs2 (int u , int fa , int opt)
{
for (auto v : edge[u])
if (v != fa && v != son[u])
dfs2 (v , u , 0);
if (son[u]) dfs2 (son[u] , u , 1), vis[son[u]] = 1;
calc (u , fa , 1);
ans[u] = maxId - dep[u];
if (son[u]) vis[son[u]] = 0;
if (!opt) calc(u, fa, -1), maxCnt = maxId = 0;
}
int main()
{
read (n);
for (int i = 1 ; i < n ; i ++)
{
int u , v;
read (u , v);
edge[u].pb (v);
edge[v].pb (u);
}
dep[1] = 1;
dfs1 (1, 1);
dfs2 (1, 0, 1);
for (int i = 1 ; i <= n ; i ++)
write(ans[i]), LF;
}
以上是Dsu On Tree