【树形DP+判唯一性】hdu 2412

看这个ppt比较清晰 http://wenku.baidu.com/view/03d35d1c59eef8c75fbfb3b4.html

#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <string>
#include <time.h>
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <cstdlib>
#include <limits.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;

#define LL long long
#define MIN INT_MIN
#define MAX INT_MAX
#define PI acos(-1.0)
#define N 210
#define FRE freopen("a.txt","r",stdin)
int max(int a,int b){return a>b?a:b;}
map<string , int> mp;
vector<int> v[N];
int n;
int dp[N][2];
bool dup[N][2];
void init(){
    mp.clear();
    int i;
    for(i=0;i<=n;i++){
        v[i].clear();
    }
    memset(dp,0,sizeof(dp));
}
void dfs(int r){
    int sz = v[r].size();
    if(sz==0){
        dp[r][0] = 0;
        dp[r][1] = 1;
        dup[r][0] = dup[r][1] = 1;
        return ;
    }dup[r][0] = dup[r][1] = 1;
    for(int i=0;i<sz;i++){
        int x = v[r][i];
        dfs(x);
        if(dp[x][0]>dp[x][1] && dup[x][0]==0)dup[r][0] = 0;
       // else
        if(dp[x][0]<dp[x][1] && dup[x][1]==0)dup[r][1] = 0;
       // else
        if(dp[x][0]==dp[x][1])dup[r][0] = 0;
        if(dup[x][0]==0)dup[r][1] = 0;
        dp[r][0]+= max(dp[x][0],dp[x][1]);
        dp[r][1]+= dp[x][0];
    }
    dp[r][1]+=1;
}
int main(){
    while(scanf("%d",&n) && n){
        init();
        int i,j;
        string str,a,b;
        cin>>str;
        mp[str] = 1;
        int m = n;
        n--;
        int cnt = 2;
        while(n--){
            cin>>a>>b;
            if(!mp[a])mp[a] = cnt++;
            if(!mp[b])mp[b] = cnt++;
            int s,t;
            s = mp[a];
            t = mp[b];
            v[t].push_back(s);
        }
        dfs(1);
        if(dp[1][0]>dp[1][1]){
            printf("%d %s\n",dp[1][0],(dup[1][0]==1)?"Yes":"No");
        }
        else
            if(dp[1][0]<dp[1][1])
            printf("%d %s\n",dp[1][1],(dup[1][1]==1)?"Yes":"No");
            else
            printf("%d %s\n",dp[1][1],"No");
    }
    return 0;
}