ural 1039 Anniversary Party

类型：树形dp

题目：http://acm.timus.ru/problem.aspx?space=1&num=1039

思路：考虑到树形结构，以1为根节点建树。用状态f(0, i)表示以i节点为根并且不包含i节点的最大值

f(1, i)表示以i节点为根并且包含i节点的最大值。因为同一条边的两个节点不能同时出现。可以得到：

f(0, i) = ∑max(f(0, j), f(1, j)) (j为i子树根)

f(1, i) = ∑f(0, j)

结果为：max(f(0, 1), f(1, 1))

// ural 1039 Anniversary Party
// ac 0.031s
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
using namespace std;

#define FOR(i,a,b) for(i = (a); i < (b); ++i)
#define FORE(i,a,b) for(i = (a); i <= (b); ++i)
#define CLR(a,b) memset(a,b,sizeof(a))

const int MAXN = 6010;
const int INF = 0x7f7f7f7f;

int n, cnt;
int dp[2][MAXN];
int val[MAXN];
int head[MAXN];
struct node {
    int v, nxt;
}p[MAXN * 2];

void addedge(int u, int v) {
    p[cnt].v = v;
    p[cnt].nxt = head[u];
    head[u] = cnt++;
    p[cnt].v = u;
    p[cnt].nxt = head[v];
    head[v] = cnt++;
}

int tree_dp(int sign, int u, int pu) {
    if(dp[sign][u] != -INF)
        return dp[sign][u];
    int i = head[u];
    int v = p[i].v;
    if(v == pu && p[i].nxt == -1) {
        if(sign == 0)
            return dp[0][u] = 0;
        else
            return dp[1][u] = val[u];
    }
    (sign == 1) ? dp[sign][u] = val[u] : dp[sign][u] = 0;
    for(i = head[u]; i != -1; i = p[i].nxt) {
        v = p[i].v;
        if(v == pu)
            continue;
        if(sign == 0)
            dp[0][u] += max(tree_dp(1, v, u), tree_dp(0, v, u));
        else
            dp[1][u] += tree_dp(0, v, u);
    }
    return dp[sign][u];
}

void input() {
    int i, a, b;

    scanf("%d", &n);
    CLR(head, -1);
    FORE(i, 1, n)
        scanf("%d", &val[i]);
    addedge(0, 1);
    FORE(i, 1, n - 1) {
        scanf("%d %d", &a, &b);
        addedge(a, b);
    }
    scanf("%d %d", &a, &b);
}

int main() {
    int i;

    input();
    FORE(i, 1, n)
        dp[0][i] = dp[1][i] = -INF;
    int t1 = tree_dp(0, 1, 0);
    FORE(i, 1, n)
        dp[0][i] = dp[1][i] = -INF;
    int t2 = tree_dp(1, 1, 0);
    printf("%d\n", max(t1, t2));
    return 0;
}