树的重心

 
推荐博客:https://www.cnblogs.com/patrickzhou/p/5867208.html
 
Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of the largest tree in the forest T created by deleting that node from T.
For example, consider the tree:

Deleting node 4 yields two trees whose member nodes are {5} and {1,2,3,6,7}. The larger of these two trees has five nodes, thus the balance of node 4 is five. Deleting node 1 yields a forest of three trees of equal size: {2,6}, {3,7}, and {4,5}. Each of these trees has two nodes, so the balance of node 1 is two.

For each input tree, calculate the node that has the minimum balance. If multiple nodes have equal balance, output the one with the lowest number.
Input
The first line of input contains a single integer t (1 <= t <= 20), the number of test cases. The first line of each test case contains an integer N (1 <= N <= 20,000), the number of congruence. The next N-1 lines each contains two space-separated node numbers that are the endpoints of an edge in the tree. No edge will be listed twice, and all edges will be listed.
Output
For each test case, print a line containing two integers, the number of the node with minimum balance and the balance of that node.
Sample Input
1
7
2 6
1 2
1 4
4 5
3 7
3 1
Sample Output
1 2

题目分析 : 找到树的重心,并输出序最小的那个,同时输出此时子树的最大结点数
代码示例 :
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
const int maxn = 2e4+5;
#define ll long long
 
int n;
vector<int>edge[maxn];
int size[maxn], mx[maxn];
int root, balance;
 
void dfs(int x, int fa){
    size[x] = 1;
    mx[x] = 0;
     
    for(int i = 0; i < edge[x].size(); i++){
        int to = edge[x][i];
         
        if (to == fa) continue;
        dfs(to, x);
        size[x] += size[to];
        mx[x] = max(mx[x], size[to]);
    }
    mx[x] = max(mx[x], n-size[x]);
    if (mx[x] < balance){
        balance = mx[x];
        root = x;
    }
    //else if (mx[x] == balance){
        //root = min(root, x);
    //}
}
 
int main() {
    int t;
    int a, b;
     
    cin >> t;
    while(t--){
        cin >> n;
        for(int i = 1; i <= n; i++){
            edge[i].clear();
        }
        for(int i = 1; i < n; i++) {
            scanf("%d%d", &a, &b);
            edge[a].push_back(b);
            edge[b].push_back(a);
        }
        balance = 99999999;
        dfs(1, 1);
        //dfs2(1, 1);
        //for(int i = 1; i <= n; i++){
            //cout << mx[i] << " " ;
        //}
        printf("%d %d\n", root, balance);    
    }
    return 0;
}

 

作者:静默虚空
欢迎任何形式的转载,但请务必注明出处。
限于本人水平,如果文章和代码有表述不当之处,还请不吝赐教。

posted @   楼主好菜啊  阅读(191)  评论(0编辑  收藏  举报
编辑推荐:
· Linux glibc自带哈希表的用例及性能测试
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 现代计算机视觉入门之:什么是图片特征编码
阅读排行:
· 手把手教你在本地部署DeepSeek R1,搭建web-ui ,建议收藏!
· Spring AI + Ollama 实现 deepseek-r1 的API服务和调用
· 数据库服务器 SQL Server 版本升级公告
· 程序员常用高效实用工具推荐,办公效率提升利器!
· C#/.NET/.NET Core技术前沿周刊 | 第 23 期(2025年1.20-1.26)
点击右上角即可分享
微信分享提示