题意:
给一颗树,求删除一个点后剩余联通块中点数最多的块点数最小的删除点,若有多解全部输出。
思路:
当删除某点时剩余联通块将包含以下情况:整颗树除以此点为根的块外的块以及此点下面的子树块。
定义dp[u]为移除点u后的答案:dp[u] = max( n-sizes[u] , max( son[u] ) )
C++代码:
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<vector>
#include<string>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;
const int maxm = 100010;
const int inf = 0x3f3f3f3f;
int n,tol,head[maxn];
struct edge
{
int to,next;
}es[maxm];
void addedge( int u , int v )
{
es[tol].to = v;
es[tol].next = head[u];
head[u] = tol++;
}
int sizes[maxn];
int son[maxn];
int dp[maxn];
void dfs1( int u , int f )
{
sizes[u] = 1;
for ( int i=head[u] ; i!=-1 ; i=es[i].next )
{
int v = es[i].to;
if ( v!=f )
{
dfs1( v , u );
sizes[u] += sizes[v];
son[u] = max ( son[u] , sizes[v] );
}
}
dp[u] = max ( n-sizes[u] , son[u] );
}
int ans,que[maxn],len;
int main()
{
while( scanf( "%d" , &n )==1 )
{
tol = 0; memset( head , -1 , sizeof(head) );
for ( int i=1 ; i<n ; i++ )
{
int u,v; scanf( "%d%d" , &u , &v );
addedge( u , v );
addedge( v , u );
}
memset ( dp , inf , sizeof(dp) );
memset ( son , 0 , sizeof(son) );
dfs1 ( 1 , 0 );
ans = inf; len = 0;
for ( int i=1 ; i<=n ; i++ )
{
if ( dp[i]<ans )
{
ans = dp[i];
que[len=1] = i;
}
else if ( dp[i]==ans )
{
que[++len] = i;
}
}
for ( int i=1 ; i<=len ; i++ )
{
if ( i!=1 ) printf( " " );
printf ( "%d" , que[i] );
}
printf ( "\n" );
}
return 0;
}