poj3107 Godfather(树的重心)
来源:互联网 发布:手机不能连接数据网络 编辑:程序博客网 时间:2024/05/17 08:50
Description
Last years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arrest the mafia leaders.
Unfortunately, the structure of Chicago mafia is rather complicated. There are n persons known to be related to mafia. The police have traced their activity for some time, and know that some of them are communicating with each other. Based on the data collected, the chief of the police suggests that the mafia hierarchy can be represented as a tree. The head of the mafia, Godfather, is the root of the tree, and if some person is represented by a node in the tree, its direct subordinates are represented by the children of that node. For the purpose of conspiracy the gangsters only communicate with their direct subordinates and their direct master.
Unfortunately, though the police know gangsters’ communications, they do not know who is a master in any pair of communicating persons. Thus they only have an undirected tree of communications, and do not know who Godfather is.
Based on the idea that Godfather wants to have the most possible control over mafia, the chief of the police has made a suggestion that Godfather is such a person that after deleting it from the communications tree the size of the largest remaining connected component is as small as possible. Help the police to find all potential Godfathers and they will arrest them.
Input
The first line of the input file contains n — the number of persons suspected to belong to mafia (2 ≤ n ≤ 50 000). Let them be numbered from 1 to n.
The following n − 1 lines contain two integer numbers each. The pair ai, bi means that the gangster ai has communicated with the gangster bi. It is guaranteed that the gangsters’ communications form a tree.
Output
Print the numbers of all persons that are suspected to be Godfather. The numbers must be printed in the increasing order, separated by spaces.
Sample Input
6
1 2
2 3
2 5
3 4
3 6
Sample Output
2 3
分析:
模板
注意最后的答案要从小到大输出
注意初始化
这里写代码片#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int INF=0x33333333;const int N=50010;int n;struct node{ int x,y,nxt;};node way[N<<1];int st[N],tot=0,ans[N],tt=0,size[N],siz;bool p[N];void add(int u,int w){ tot++; way[tot].x=u;way[tot].y=w;way[tot].nxt=st[u];st[u]=tot; tot++; way[tot].x=w;way[tot].y=u;way[tot].nxt=st[w];st[w]=tot;}void dfs(int now,int fa){ int maxx=0; size[now]=1; for (int i=st[now];i;i=way[i].nxt) { int y=way[i].y; if (y!=fa&&p[y]) { p[y]=0; dfs(y,now); size[now]+=size[y]; maxx=max(maxx,size[y]); } } maxx=max(maxx,n-size[now]); if (maxx<siz) { siz=maxx; ans[tt=1]=now; } else if (maxx==siz) ans[++tt]=now;}int main(){ scanf("%d",&n); for (int i=1;i<n;i++) { int u,w; scanf("%d%d",&u,&w); add(u,w); } siz=INF; memset(p,1,sizeof(p)); p[1]=0; dfs(1,0); sort(ans+1,ans+1+tt); for (int i=1;i<=tt;i++) printf("%d ",ans[i]); return 0;}
- poj3107 Godfather(树的重心)
- POJ3107 Godfather 求树的重心
- POJ3107-树的重心&树形DP-Godfather
- poj3107(树的重心)
- poj3107 树的重心
- 树的重心求法POJ3107
- poj3107 Godfather(鬼题畜译)
- Godfather (树形dp,树的重心)
- Godfather (树形dp + 树的重心)
- poj3107 树的重心 非stl实现
- 【poj1655】【poj3107】【求树的重心】
- [POJ3107]Godfather(树形dp)
- poj 3107 Godfather(树形dp,树的重心)
- POJ 题目3107 Godfather(树的重心)
- POJ 3107 Godfather (求树的重心)
- poj 3107 Godfather(树的重心问题)
- Poj 3107 Godfather (树的重心)
- POJ 3107 Godfather (树的重心)
- java常用设计模式小结
- 原来钱还可以这样赚!0门槛,0难度,免费日加几百粉
- js刷新本showModalDialog窗口
- 笔记:jemalloc库github官方下载链接。
- maven 初探笔记
- poj3107 Godfather(树的重心)
- HTML+CSS+JS 简单的计算器
- linux_shell
- 火狐浏览器禁用js
- Java多线程系列--“JUC锁”07之 LockSupport
- 鼠标拖拽事件实现
- 分享几个前端工具--制作加载中小图标
- reboot系统调用的时候会调用shutdown函数
- 基于rk3288平台android5.1系统的wifi流程分析 ---- 打开wifi,扫描热点