Description
经过了几周的辛苦工作,贝茜终于迎来了一个假期.作为奶牛群中最会社交的牛,她希望去拜访N(1<=N<=50000)个朋友.这些朋友被标号为1..N.这些奶牛有一个不同寻常的交通系统,里面有N-1条路,每条路连接了一对编号为C1和C2的奶牛(1 <= C1 <= N; 1 <= C2 <= N; C1<>C2).这样,在每一对奶牛之间都有一条唯一的通路.FJ希望贝茜尽快的回到农场.于是,他就指示贝茜,如果对于一条路直接相连的两个奶牛,贝茜只能拜访其中的一个.当然,贝茜希望她的假期越长越好,所以她想知道她可以拜访的奶牛的最大数目.
Input
第1行:单独的一个整数N第2..N行:每一行两个整数,代表了一条路的C1和C2.
Output
单独的一个整数,代表了贝茜可以拜访的奶牛的最大数目.
Sample Input
7
6 2
3 4
2 3
1 2
7 6
5 6
INPUT DETAILS:
Bessie knows 7 cows. Cows 6 and 2 are directly connected by a road,
as are cows 3 and 4, cows 2 and 3, etc. The illustration below depicts the
roads that connect the cows:
1--2--3--4
|
5--6--7
6 2
3 4
2 3
1 2
7 6
5 6
INPUT DETAILS:
Bessie knows 7 cows. Cows 6 and 2 are directly connected by a road,
as are cows 3 and 4, cows 2 and 3, etc. The illustration below depicts the
roads that connect the cows:
1--2--3--4
|
5--6--7
Sample Output
4OUTPUT DETAILS:
Bessie can visit four cows. The best combinations include two cows
on the top row and two on the bottom. She can't visit cow 6 since
that would preclude visiting cows 5 and 7; thus she visits 5 and
7. She can also visit two cows on the top row: {1,3}, {1,4}, or
{2,4}.
题目大意:
给定一些无向边组成的一棵树,对于树的每一条边至多选择一个节点,求整棵树最多选择多少个节点。
题解:
此题相当于无向边的没有上司的舞会,树形dp。
dp[i][0]表示i为根的子树满足条件,i不选的情况。
dp[i][1]表示i为根的子树满足条件,i选的情况。
那么i选,和i相邻的,即i的儿子,必然是不选的情况。
i不选,i的儿子可选可不选(贪心不行,有可能i的父亲选择的话比i更优),取i的儿子选择情况的最大值即可。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=50001;
struct xx
{
int from,to,nxt;
}e[MAXN<<1];
int head[MAXN<<1],cnt,n,m;
int father[MAXN<<1];
int dp[MAXN][3];
inline void add(int x,int y)
{
cnt++;
e[cnt].from=x;
e[cnt].to=y;
e[cnt].nxt=head[x];
head[x]=cnt;
}
void build(int x)
{
int i,t;
dp[x][1]=1;
for(i=head[x];i;i=e[i].nxt)
{
t=e[i].to;
if(t==father[x]) continue;
father[t]=x;
build(t);
dp[x][1]+=dp[t][0];
dp[x][0]+=max(dp[t][0],dp[t][1]);
}
}
int main(int argc, char *argv[])
{
int i,j,x,y;
scanf("%d",&n);
for(i=1;i<n;i++)
scanf("%d%d",&x,&y),add(x,y),add(y,x);
build(1);
printf("%d\n",max(dp[1][0],dp[1][1]));
return 0;
}