HDU-6178 Monkeys - 2017 Multi-University Training Contest - Team 10(树形DP)

题意：

给定一颗n节点的树，k个猴子，每个猴子只能占据一个节点，共占据k个节点，问去掉这棵树的若干条边之后至少需要保持多少条边使每个猴子都有与其相邻的猴子。

思路：

就是找出这棵树最多能分成多少个不相关的两个相连的块，进行一次树形dp统计就可以，树形dp复杂度O(n)，但由于数据读入高达1e7，还需要再加个fread才能过。

代码：

#include <bits/stdc++.h>
#define ll long long
namespace fastIO   
{    
    #define BUF_SIZE 100000    
    //fread -> read    
    bool IOerror = 0;    
    inline char nc()   
    {    
        static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;    
        if(p1 == pend)   
        {    
            p1 = buf;    
            pend = buf + fread(buf, 1, BUF_SIZE, stdin);    
            if(pend == p1)  
            {    
                IOerror = 1;    
                return -1;    
            }    
        }    
        return *p1++;    
    }    
    inline bool blank(char ch)  
    {    
        return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';    
    }    
    inline void read(int &x)  
    {    
        char ch;    
        while(blank(ch = nc()));    
        if(IOerror) return;    
        for(x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0');    
    }    
    #undef BUF_SIZE    
};    
using namespace fastIO;
using namespace std; 
const int maxn = 100005;
int dp[maxn][2], t, n, m;
vector<int> G[maxn];
void dfs(int u)
{
	int len = G[u].size();
	int val1 = 0, val2 = 0, flag = 0, key = 0;
	for(int i = 0; i < len; ++i)
	{
		int v = G[u][i];
		dfs(v);
		val1 += max(dp[v][0], dp[v][1]);
		if(dp[v][0] >= dp[v][1]) flag = 1;
		val2 = max(dp[v][1]-dp[v][0], val2);
		key = 1;
	}
	dp[u][0] = val1;
	if(flag) dp[u][1] = val1+1;
	else if(key) dp[u][1] = val1-val2+1;
	else dp[u][1] = 0;
}
int main()
{
    //freopen("in.txt", "r", stdin);
    read(t);
    while(t--)
    {
        read(n); read(m);
        for(int i = 1; i <= n; i++)
        G[i].clear();
        for(int i = 2; i <= n; i++)
        {
            int x; read(x);
            G[x].push_back(i);
        }
        memset(dp, 0, sizeof dp);
        dfs(1);
        int num = max(dp[1][0], dp[1][1]), ans=0;
        if(m <= num*2) ans = (m+1)/2;
        else ans = (m-num*2)+num;
        printf("%d\n",ans);
    }
    return 0;
}

继续加油~