Acwing_831树的重心 【树的存储方式采用基于数组的邻接表】

AC代码:

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N = 100010,M = 2*N;
int n, m;
int h[N], e[M],ne[M], idx;
bool st[N];
int ans = N;
void add(int a,int b) {
	e[idx] = b;
	ne[idx] = h[a];
	h[a] = idx++;
}
int dfs(int u) {
	st[u] = true;
	int sum = 1,res = 0;
	for (int i = h[u]; i != -1; i = ne[i]) {
		int j = e[i];
		if (!st[j]) {
			int s = dfs(j);
			res = max(res, s);
			sum += s;
		}
	}
	res = max(res, n - sum);
	ans = min(ans, res);
	return sum;
}

int main()
{
	memset(h, -1, sizeof h);
	scanf("%d", &n);
	for (int i = 0; i < n-1; i++) {
		int a, b;
		scanf("%d%d", &a, &b);
		add(a, b), add(b, a);
	}
	dfs(1);
	printf("%d", ans);
	system("pause");
	return 0;
}