动态规划——树型dp

acwing285.没有上司的舞会

#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

const int N = 6010;

int n;
int h[N], e[N], ne[N], idx;
int happy[N];
int f[N][2];
bool has_father[N];

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}

void dfs(int u)
{
    f[u][1] = 1;
    
    for(int i = h[u]; i != -1; i = ne[i])
    {
        int j = e[i];
        dfs(j);

        f[u][1] += f[j][0];
        f[u][0] += max(f[j][1], f[j][0]);
    }
}

int main()
{
    memset(h, -1, sizeof h);
    
    cin >> n;
    
    for(int i = 1; i <= n; i ++ ) cin >> happy[i];
    
    for(int i = 0; i < n - 1; i ++ )
    {
        int a, b;
        cin >> a >> b;
        has_father[a] = true;
        add(b, a);
    }
    
    int root = 1;
    for(int i = 1; i <= n; i ++ )
    {
        if(!has_father[i])
        {
            root = i;
            break;
        }
    }
    
    dfs(root);
    
    cout << max(f[root][0], f[root][1]);
    return 0;
}