ural 1039 anniversary party

树形dp。。。。

没啥说的

#include<stdio.h>
#include<string.h>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

int dp[6001][2] = {0};
int father[6001]= {0};
int visit[6001] = {0};
int m;
void tree_dp(int node)
{
    int i;
    visit[node] = 1;
    for(i=1;i<=m;i++)
    {
        if(!visit[i]&&father[i] == node)
        {
            tree_dp(i);
            dp[node][1] += dp[i][0];
            dp[node][0] += max(dp[i][1],dp[i][0]);
        }
    }
}

int main()
{
 scanf("%d",&m);
 for(int i=1;i<=m;i++)
    {
        scanf("%d",&dp[i][1]);
    }
    int root = 0;
    int u,v;
    while(scanf("%d%d",&u,&v)&&u)
    {
        father[u] = v;
        root = v;

    }
    while(father[root])
        root = father[root];
    //printf("%d\n",root);
    tree_dp(root);
    printf("%d\n",dp[root][0]>dp[root][1]?dp[root][0]:dp[root][1]);

 return 0;
}