poj 1655 Balancing Act(树形DP)
2016-04-27 21:19
344 查看
Balancing Act
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 |
[Discuss]
题目大意:定义一个节点的balance是删去该节点形成的子树中节点数最多的,求所有节点中balance最小的。
题解:树形DP
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> #define N 20003 using namespace std; int n,m,t; int next[N*2],point[N*2],v[N*2],size[N*2],f ,tot; void add(int x,int y) { tot++; next[tot]=point[x]; point[x]=tot; v[tot]=y; tot++; next[tot]=point[y]; point[y]=tot; v[tot]=x; } void dfs(int x,int fa) { size[x]=1; for (int i=point[x];i;i=next[i]) if (v[i]!=fa) { dfs(v[i],x); size[x]+=size[v[i]]; f[x]=max(f[x],size[v[i]]); } f[x]=max(f[x],n-size[x]); } int main() { scanf("%d",&t); for (int l=1;l<=t;l++) { scanf("%d",&n); tot=0; memset(f,0,sizeof(f)); memset(point,0,sizeof(point)); memset(next,0,sizeof(next)); for (int i=1;i<n;i++) { int x,y; scanf("%d%d",&x,&y); add(x,y); } dfs(1,0); int ans=1000000000; int x=0; for (int i=1;i<=n;i++) if (ans>f[i]) ans=f[i],x=i; printf("%d %d\n",x,ans); } }
相关文章推荐
- java毕向东听课笔记27(集合框架-Map)
- 学习总结
- 线程同步
- C++11 中的单例模式
- IDEA 主题、字体、编辑区主题、文件编码修改
- 设置UITabBarController的用法
- 【BZOJ4513】【Sdoi2016】储能表
- 苹果Mac OS X怎样设置鼠标滚轮滑动的方向/反向
- Python爬取并分析网页【基本版】
- 人脸识别技术大总结(1)——Face Detection & Alignment
- Java HashSet和HashMap源码剖析
- Codeforces--237C--Primes on Interval(二分水题)
- skia : --- SkImageDecoder::Factory returned null
- 线程面试题
- 在Mac中设置Ctrl+C/V进行复制/粘贴
- Qt之自定义提示框(类似QMessageBox)
- Volley
- 记录使用GitHub经历
- jquery.min.js一引入到工程中显示红叉
- Lock和synchronized的区别