AcWing 846. 数的重心
用数组进行邻接表存储方式,然后使用DFS进行图的遍历。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010, M = N * 2;
int n;
int h[N], e[M], ne[M], idx;
int ans = N;//全局变量,存最终结果
bool st[N];
void add(int a, int b) {
e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}
//返回以u为节点的子树的节点个数
int dfs(int u) {
st[u] = true;
int size = 0, sum = 0;//size保存除根节点u外,子树的最大节点个数;sum保存连同根节点在内的节点个数
for (int i = h[u]; i != -1; i = ne[i]) {
int j = e[i];
if (st[j]) continue;
int s = dfs(j);
size = max(size, s);
sum += s;
}
size = max(size, n - sum - 1);//整个树中,除去以u为根节点的树的节点个数
ans = min(ans, size);
return sum + 1;
}
int main() {
scanf("%d", &n);
memset(h, -1, sizeof h);
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\n", ans);
return 0;
}