POJ 1655 Balancing Act(树的重心)
Description
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
Source
POJ Monthly--2004.05.15 IOI 2003 sample task
dp求树的重心:
我们首先找到每一个节点所有子树的大小。
然后用n-size[pos]算出祖先的大小,
判断即可
1 #include<iostream>
2 #include<cstdio>
3 #include<cstring>
4 #include<cmath>
5 #define lli long long int
6 using namespace std;
7 const int MAXN=2000001;
8 const int maxn=0x7fffff;
9 void read(int &n)
10 {
11 char c='+';int x=0;bool flag=0;
12 while(c<'0'||c>'9'){c=getchar();if(c=='-')flag=1;}
13 while(c>='0'&&c<='9')
14 x=(x<<1)+(x<<3)+c-48,c=getchar();
15 flag==1?n=-x:n=x;
16 }
17 struct node
18 {
19 int u,v,w,nxt;
20 }edge[MAXN];
21 int head[MAXN];
22 int num=1;
23 int size[MAXN];
24 int ans=maxn;
25 int out=maxn;
26 int n;
27 int mx[MAXN];
28 void add_edge(int x,int y)
29 {
30 edge[num].u=x;
31 edge[num].v=y;
32 edge[num].nxt=head[x];
33 head[x]=num++;
34 }
35 void dfs(int pos,int fa)
36 {
37 // cout<<pos<<endl;
38 size[pos]=1;
39 int now=0;
40 for(int i=head[pos];i!=-1;i=edge[i].nxt)
41 {
42
43 if(edge[i].v!=fa)
44 {
45 dfs(edge[i].v,pos);
46 size[pos]+=size[edge[i].v];
47 mx[pos]=max(mx[pos],size[edge[i].v]);
48 }
49 }
50 mx[pos]=max(mx[pos],n-size[pos]);
51 if(mx[pos]<mx[ans])
52 ans=pos;
53 if(mx[pos]==mx[ans]&&pos<ans)
54 ans=pos;
55 }
56 int main()
57 {
58 int T;
59 read(T);
60 while(T--)
61 {
62 read(n);
63 //cout<<maxn<<endl;
64 num=1;
65 memset(head,-1,sizeof(head));
66 memset(size,0,sizeof(size));
67 memset(mx,0,sizeof(mx));
68 mx[0]=maxn;
69 ans=0;
70 for(int i=1;i<=n-1;i++)
71 {
72 int x,y,z;
73 read(x);read(y);
74 add_edge(x,y);
75 add_edge(y,x);
76 }
77 dfs(1,0);
78 printf("%d %dn",ans,mx[ans]);
79
80 }
81 return 0;
82 }
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法
- 【Java面试总结】Java基础(上篇)
- Esxi安装LEDE(OpenWrt) | 旧电脑变庞路由
- [白话解析] 深入浅出贝叶斯定理
- LEDE(OpenWrt)安装openclash |旁路由技巧 | 配置网络流量全部通过旁路由
- [白话解析] 深入浅出朴素贝叶斯模型原理及应用
- 【Java面试总结】Java基础(下篇)
- 使用现代化的脚本进行 ArcGIS JS API 开发
- TextField suffixIcon点击时TextField 选中弹出键盘<Flutter Bug篇>
- seata redis模式重构之全局事务更新
- 【STM32F407】第7章 RL-TCPnet V7.X网络协议栈移植(RTX5)
- 【STM32F429】第7章 RL-TCPnet V7.X网络协议栈移植(RTX5)
- [白话解析] 深入浅出 极大似然估计 & 极大后验概率估计
- 【STM32H7】第7章 RL-TCPnet V7.X网络协议栈移植(RTX5)
- TinyMCE 富文本编辑器的使用实例指导
- dotnet 在国产 UOS 系统利用 dotnet tool 工具做文件传输