poj 3107 Godfather (树形dp)

Godfather
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 5064   Accepted: 1769

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 aibi 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<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
#define ll long long
#define N 51000
#define mem(a,t) memset(a,t,sizeof(a))
vector<int>g[N];
int ans[N];

struct ege
{
int v,next;
}e[N*2];
int head[N];
int cnt,n,n1,mmin;
int num[N]; //记录i子树包括节点数
void add(int u,int v)
{
e[cnt].v=v;
e[cnt].next=head[u];
head[u]=cnt++;
}
int dfs(int u,int fa)
{
int i,v,tmp=0,t1;
num[u]=1; //求当前树枝U的子节点和本身的个数和
for(i=head[u];i!=⑴;i=e[i].next)
{
v=e[i].v;
if(v!=fa)
{
num[u]+=dfs(v,u);
tmp=max(tmp,num[v]);
}
}
t1=max(tmp,n-num[u]); //去掉点u后,最大树的节点数目
if(t1<mmin)
{
mmin=t1;
n1=0;
ans[n1++]=u;
}
else if(t1==mmin)
{
ans[n1++]=u;
}
return num[u];
}

int main()
{
//freopen("in.txt","r",stdin);
int i,j,u,v;
while(~scanf("%d",&n))
{
mem(head,⑴);
cnt=0;
for(i=1;i<n;i++)
{
scanf("%d%d",&u,&v);
add(u,v);
add(v,u);
}
mem(num,0); //num[i]记录节点i的子树点个数
n1=0;
mmin=n;
dfs(1,⑴);
sort(ans,ans+n1);
for(i=0;i<n1;i++)
printf("%d%c",ans[i],(i==n1⑴)?'
':' ');
}
return 0;
}

波比源码 – 精品源码模版分享 | www.bobi11.com
1. 本站所有资源来源于用户上传和网络,如有侵权请邮件联系站长!
2. 分享目的仅供大家学习和交流,您必须在下载后24小时内删除!
3. 不得使用于非法商业用途,不得违反国家法律。否则后果自负!
4. 本站提供的源码、模板、插件等等其他资源,都不包含技术服务请大家谅解!
5. 如有链接无法下载、失效或广告,请联系管理员处理!
6. 本站资源售价只是赞助,收取费用仅维持本站的日常运营所需!
7. 如遇到加密压缩包,请使用WINRAR解压,如遇到无法解压的请联系管理员!

波比源码 » poj 3107 Godfather (树形dp)

发表评论

Hi, 如果你对这款模板有疑问,可以跟我联系哦!

联系站长
赞助VIP 享更多特权,建议使用 QQ 登录
喜欢我嘛?喜欢就按“ctrl+D”收藏我吧!♡