树状dpPOJ3342Party at Hali-Bula

题意很简单，还是员工不想见老板，只不过多了一个判断唯一性的东西，感觉有点小意思，其实也就是加了一个数组来判断是否是唯一的，然后递归的时候顺便判断一下唯一性就好了，不多说上代码~~~

这道题还看到不少别人的代码，有的不少感觉挺有借鉴意义的，比如说在范围不是很大空间不是很紧张的情况下，可以用二维数组直接无脑储存关系，不过想了想还是以前的儿子兄弟方法比较习惯，还有一种判断是否唯一的代码感觉很有意思，特意把代码贴在下面一共以后研究。

include<iostream>
#include<fstream>
#include<string>
#include<map>
using namespace std;

int n;
int g[201][201];

int dp[201][2];

string str1,str2;

void solve(int s)
{
    int i,j,k;

    dp[s][0]=0;
    dp[s][1]=1;
    for(i=1; i<=n; i++)
        if(g[s][i])
        {
            solve(i);
            dp[s][0]+=max(dp[i][0],dp[i][1]);
            dp[s][1]+=dp[i][0];
        }
}

void read()
{
//  ifstream cin("in.txt");
    int i,j,k;
    while(cin>>n)
    {
        if(n==0) return;
        map<string,int> mp;
        cin>>str1;
        int cnt=1;
        mp[str1]=cnt++;
        memset(g,0,sizeof(g));

        for(i=1; i<n; i++)
        {
            cin>>str1>>str2;
            if(mp[str1]==0)
                mp[str1]=cnt++;
            if(mp[str2]==0)
                mp[str2]=cnt++;
            g[mp[str2]][mp[str1]]=1;
        }
        solve(1);
        cout<<max(dp[1][0],dp[1][1])<<' ';
        if(n==2)
        {
            cout<<"No"<<endl;
            continue;
        }

        for(i=1; i<=n; i++)
        {
            if(dp[i][0]==dp[i][1])
            {
                for(j=1; j<=n; j++)
                    if(g[i][j]&&dp[j][0]==dp[j][1])break;
                if(j<=n) break;
            }
        }
        if(i<=n) cout<<"No"<<endl;
        else
            cout<<"Yes"<<endl;


    }

}

int main()
{
    read();
    return 0;
}

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <functional>
#include <cstdio>
#include <queue>
#include <map>
#include <algorithm>
#include <stack>
#include <utility>
typedef long long ll;
using namespace std;
const int mx = 202;
const int mod = 10000007;
int a[mx][2],b[mx][2],father[mx],son[mx],brother[mx];
char name1[102],name2[103];
string s1,s2;
 map <string,int> name;
void dfs(int i)
{
    ///printf("i = %d\n",i);
    int k;
    k = son[i];
    a[i][0] = 1;
    b[i][0] = 0;
    while(k)
    {
        dfs(k);
        a[i][0] += b[k][0];
        if(b[k][1] == 1)
        a[i][1] = b[k][1];
        b[i][0] += max(b[k][0],a[k][0]);
        if(b[k][0] == a[k][0])
            b[i][1] = 1;
        if(b[k][0] > a[k][0] && b[k][1])
            b[i][1] = 1;
        if(b[k][0] < a[k][0] && a[k][1])
            b[i][1] = 1;
        k = brother[k];
    }
    ///printf("a = %d b = %d\n",a[i][0],b[i][0]);
}
int main ()
{
    int n,i,j,k,l,h,g;
    int num,ans;
    bool OK;
    while (scanf("%d",&n)&&n)
    {
       
        OK = true;
        ans = 0;
        memset(son,0,sizeof(son));
        memset(brother,0,sizeof(brother));
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        num = 0;
        name.clear();
        scanf("%s",name1);
        s1 = name1;
        name[s1] = ++num;
        for(i = 1; i < n; i++)
        {
            scanf("%s%s",name1,name2);
            s1 = name1;
            s2 = name2;
            if(!name[s1]) name[s1] = ++num;
            if(!name[s2]) name[s2] = ++num;
            l = name[s1];
            h = name[s2];
            ///printf("h = %d l = %d\n",h,l);
            brother[l] = son[h];
            son[h] = l;
        }
        dfs(1);
        ans = max(a[1][0] ,b[1][0]);
        if(a[1][0] == b[1][0])
            OK = false;
        if(a[1][0] == ans && a[1][1])
            OK = false;
        if(b[1][0] == ans && b[1][1])
            OK = false;
    printf("%d ",ans);
    if(OK)
        printf("Yes\n");
    else
        printf("No\n");
    }

}