POJ 3107 Godfather
来源:互联网 发布:用ss网络会不会被监控 编辑:程序博客网 时间:2024/04/30 04:12
树形DP
[Submit] [Go Back] [Status]
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
61 22 32 53 43 6
Sample Output
2 3
Source
[Submit] [Go Back] [Status]
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int INF=0x3f3f3f3f;typedef struct edge{ int to,next;}Edge;int Size,Adj[105000],n;Edge E[105000];void init(){ Size=0; memset(Adj,-1,sizeof(Adj));}void Add_Edge(int u,int v){ E[Size].to=v; E[Size].next=Adj[u]; Adj[u]=Size++;}int dp[105000],cnt[105000],ret;void dfs(int fa,int u){ cnt[u]=1,dp[u]=0; for(int i=Adj[u];~i;i=E[i].next) { int v=E[i].to; if(v==fa) continue; dfs(u,v); cnt[u]+=cnt[v]; dp[u]=max(dp[u],cnt[v]); } dp[u]=max(dp[u],n-cnt[u]); ret=min(ret,dp[u]);}int main(){while(scanf("%d",&n)!=EOF){ init(); memset(dp,0,sizeof(dp)); for(int i=0;i<n-1;i++) { int a,b; scanf("%d%d",&a,&b); Add_Edge(a,b); Add_Edge(b,a); } ret=INF; dfs(0,1); for(int i=1;i<=n;i++) { if(dp[i]==ret) printf("%d ",i); } putchar(10);} return 0;}
- POJ 3107 Godfather(DFS)
- POJ 3107 - Godfather
- POJ 3107 Godfather
- POJ 3107 Godfather
- POJ 3107 Godfather
- POJ 3107 Godfather
- poj 3107 Godfather
- poj 3107 Godfather
- poj 3107 Godfather
- poj 3107 Godfather
- POJ 3107 Godfather
- Godfather POJ - 3107
- POJ 3107 Godfather 笔记
- POJ-3107-Godfather
- [POJ] 3107 Godfather
- POJ 3107 Godfather 树状DP
- POJ 3107 Godfather(树形dp)
- Godfather - POJ 3107 树形dp
- USACO 2009 Feb Revamping Trails 道路翻新
- 怒删了很多东西
- [CrackCode] 5.2 Print the binary representation
- USACO 2009 Feb Cruel Math Teacher 数的幂次
- [WebKit]WebCore之页面加载的设计与实现(二)
- POJ 3107 Godfather
- IDA + GDBServer实现iPhone程序远程调试
- C++ STL,ATL,WTL之间的联系和区别
- poll的设计
- hadoop:start-all.sh 启动时出错
- USACO 2012 Mar Haybale Restacking 重排干草
- 关于Java端 读取WebService 报错java.io.IOException: Server returned HTTP response code: 500 for URL: http:/
- USACO 2004 OPEN Moofest 奶牛集会
- 微信开发之移动手机WEB页面(HTML5)Javascript实现一键拨号及短信发送功能