POJ 2342 & HDU 1520 Anniversary party (树形DP)

入门树形DP。dp[i][0]表示不选i时的最优值，dp[i][1]表示选i时的最优值，则有: dp[i][0] = max(dp[j][0],dp[j][1]), dp[i][1] = dp[j][0] + v[i];其中j是i的儿子节点，v[i]是取i时获得的值。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define SIZE 6060

using namespace std;

struct node
{
    int to,next;
}edge[SIZE*60];
int head[SIZE],idx;

int n,val[SIZE];
int dp[SIZE][2];
int fa[SIZE];

void addnode(int from,int to)
{
    edge[idx].to = to;
    edge[idx].next = head[from];
    head[from] = idx++;
}

void dfs(int rt)
{
    bool flag = false;
    for(int i=head[rt]; i!=-1; i=edge[i].next)
    {
        flag = true;
        int to = edge[i].to;
        dfs(to);
        dp[rt][0] += max(dp[to][0],dp[to][1]);
        dp[rt][1] += dp[to][0];
    }
    if(!flag)
    {
        dp[rt][0] = 0;
        dp[rt][1] = val[rt];
    }
    else
        dp[rt][1] += val[rt];
}

int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=1; i<=n; i++)
            scanf("%d",&val[i]);
        int l,k;
        idx = 0;
        memset(head,-1,sizeof(head));
        memset(dp,0,sizeof(dp));
        memset(fa,0,sizeof(fa));
        while(scanf("%d%d",&l,&k))
        {
            if(!l && !k)
                break;
            addnode(k,l);
            fa[l] = k;
        }
        for(int i=1; i<=n; i++)
        {
            if(!fa[i])
            {
                dfs(i);
                printf("%d\n",max(dp[i][0],dp[i][1]));
                break;
            }
        }
    }
    return 0;
}

 

孩子兄弟表示法：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define SIZE 6060

using namespace std;

int n,v[SIZE];
int bro[SIZE],son[SIZE];
bool fa[SIZE];
int dp[SIZE][2];

void dfs(int fat)
{
    int s = son[fat];
    while(s)
    {
        dfs(s);
        dp[fat][0] += max(dp[s][0],dp[s][1]);
        dp[fat][1] += dp[s][0];
        s = bro[s];
    }
}

int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=1; i<=n; i++)
            scanf("%d",&v[i]);
        int l,k;
        memset(bro,0,sizeof(bro));
        memset(son,0,sizeof(son));
        memset(fa,0,sizeof(fa));
        memset(dp,0,sizeof(dp));
        for(int i=1; i<=n; i++)
            dp[i][1] = v[i];
        while(scanf("%d%d",&l,&k))
        {
            if(!l && !k)
                break;
            bro[l] = son[k];
            son[k] = l;
            fa[l] = true;
        }
        for(int i=1; i<=n; i++)
        {
            if(fa[i])
                continue;
            dfs(i);
            printf("%d\n",max(dp[i][0],dp[i][1]));
            break;
        }
    }
    return 0;
}