jcyzoj1309: 猴猴吃苹果

原题链接
长链剖分.
定义ls[x]为x的最大深度子树的根节点编号，
dfs1预处理深度dep, 父亲fa, 以x为根的子树深度dist,
dfs2先遍历长链，记录dl[x]为x距长链顶端的距离，即为猴猴去往x节点吃到的苹果数量，排序输出即可.
注意要满足吃到的苹果数量相同时，先去往编号小的节点这一限制条件，
可通过维护leaf[x]实现.
代码如下：

#include <bits/stdc++.h>

using namespace std;

inline int read() {
	int x = 0, f = 0; char ch = getchar();
	while (!isdigit(ch)) f = ch == '-', ch = getchar();
	while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

const int N = 50010, M = 100010;
int n, rt, head[N], nex[M], ver[M], tot = 1; 
int fa[N], ls[N], dist[N], dep[N], dl[N], leaf[N]; 
vector<int> ans; 

void Add(int x, int y) {
	ver[++tot] = y; 
	nex[tot] = head[x]; 
	head[x] = tot; 
}

void dfs1(int x, int father) {
	dep[x] = dep[father] + 1; 
	fa[x] = father; 
	for (int i = head[x]; i; i = nex[i]) {
		int y = ver[i]; 
		if (y == father) continue; 
		dfs1(y, x); 
		if (dist[y] > dist[ls[x]] || (dist[y] == dist[ls[x]] && leaf[y] < leaf[ls[x]])) ls[x] = y; 
	}
	dist[x] = dist[ls[x]] + 1; 
	if (!ls[x]) ans.push_back(x), leaf[x] = x; 
	else leaf[x] = leaf[ls[x]];  
}

void dfs2(int x, int topx) {
	dl[x] = dep[x] - dep[topx]; 
	if (!ls[x]) return; 
	dfs2(ls[x], topx); 
	for (int i = head[x]; i; i = nex[i]) {
		int y = ver[i]; 
		if (y == fa[x] || y == ls[x]) continue; 
		dfs2(y, x); 
	} 
}

bool cmp(int x, int y) {
	if (dl[x] == dl[y]) return x < y;
	return dl[x] > dl[y]; 
}

int main() { 
	n = read(); rt = read() + 1; 
	for (int i = 2; i <= n; ++i) {
		int u = read() + 1; 
		Add(u, i); Add(i, u);  
	}
	dfs1(rt, 0);
	dfs2(rt, rt); 
	printf("%d\n", rt - 1); 
	sort(ans.begin(), ans.end(), cmp); 
	for (int j = 0; j < (int)ans.size(); ++j) {
		printf("%d\n", ans[j] - 1); 
	}
	return 0;
}