题目:http://acm.hdu.edu.cn/showproblem.php?pid=1054
简单的树形DP,不多说。
#include<bits/stdc++.h>
#define INF 1e18
#define inf 1e9
#define min(a,b) a<b?a:b
#define max(a,b) a>b?a:b
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
const int _max = 1505;
int c[_max];
int dp[_max][2];
vector<int> mp[_max];
void dfs_dp(int f){
for(int i = 0 ; i < mp[f].size() ; i++){
int s = mp[f][i];
dfs_dp(s);
dp[f][1] += min(dp[s][0],dp[s][1]);
dp[f][0] += dp[s][1];
}
}
int main(){
IOS;
int n,m;
while(cin>>n){
memset(c,0,sizeof(c));
memset(dp,0,sizeof(dp));
for(int i = 0 ; i < n ; i++){
mp[i].clear();
dp[i][1] = 1;
}
int u,v;
for(int i = 0 ; i < n ; i++){
cin>>u;
cin.get();cin.get();
cin>>m;
cin.get();
for(int j = 0 ; j < m ; j++){
cin>>v;
c[v]++;
mp[u].push_back(v);
}
}
int root;
for(int i = 0 ; i < n ; i++)
if(c[i] == 0){
root = i;
break;
}
dfs_dp(root);
int ans_min = min(dp[root][1],dp[root][0]);
cout<<ans_min<<endl;
}
return 0;
}