没有上司的舞会

没有上司的舞会

具体代码如下

#include<iostream>
#include<cstring>

using namespace std;

const int N = 6010;

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

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

void dfs(int u){
    
    f[u][1] = happy[u];
    for(int i = h[u]; ~i; i = ne[i]){
        int j = e[i];
        dfs(j);
        f[u][0] += max(f[j][0], f[j][1]);
        f[u][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;
        add(b, a);
        has_fa[a] = true;
    }
    
    int fa = 1;
    while(has_fa[fa]) fa ++;
    
    dfs(fa);
    
    cout << max(f[fa][0], f[fa][1]) << endl;
    
    return 0;
}