P1352 没有上司的舞会(树形dp)

没有上司的舞会 - 洛谷

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n;
int r[MAXN];
int head[MAXN];
int nxt[MAXN];
int ver[MAXN];
int f[10000][2];
int cnt;
bool vis[MAXN];
inline void add(int x, int y) {
	ver[++cnt] = y;
	nxt[cnt] = head[x];
	head[x] = cnt;
}


void dp(int p) {
	f[p][1] = r[p];
	for (int i = head[p]; i; i = nxt[i]) {
		int v = ver[i];
		dp(v);
		f[p][1] += f[v][0];
		f[p][0] += max(f[v][1], f[v][0]);
	}
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d", r + i);
	}
	int x, y;
	for (int i = 1; i < n; i++) {
		scanf("%d %d", &x, &y);
		add(y, x);
		vis[x] = true;
	}
	int root;
	for (int i = 1; i <= n; i++) {
		if (!vis[i]) {
			root = i;
			break;
		}
	}
	dp(root);
	printf("%d", max(f[root][1], f[root][0]));
	return 0;
}