HDU 4340 Capturing a country ()

树状DP，最开始一点想法都没有，看了这篇博客http://blog.csdn.net/cyberzhg/article/details/7840922才领悟了一点，然后再自己敲敲代码，才弄懂了。

 

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <stack>
using namespace std;
#define ll long long
#define int64 __int64
#define M 100005
#define N 10005
#define inf 1<<30
#define mod 1000000007

int n , a[105] , b[105] , dp[105][2][2];
//dp[i][0][0] 代表A占领i点，i点取一半且树不完整  
//dp[i][0][1] 代表A占领i点，树完整  
//dp[i][1][0] 代表B占领i点，i点取一半且树不完整  
//dp[i][1][1] 代表B占领i点，树完整  

vector<int> son[N];

void Dfs(int s , int fa)
{
	int i , up = son[s].size();
	int sa = 0 , sb = 0;
	int da = inf , db = inf;
	for (i = 0 ; i < up ; i++)
	{
		int v = son[s][i];
		if (v == fa)continue;
		Dfs(v,s);
		sa += min(dp[v][0][0],dp[v][1][1]);
		sb += min(dp[v][1][0],dp[v][0][1]);
		da = min(da,dp[v][0][1]-min(dp[v][0][0],dp[v][1][1]));
		db = min(db,dp[v][1][1]-min(dp[v][1][0],dp[v][0][1]));
	}
	dp[s][0][0] = sa+a[s]/2;
	dp[s][0][1] = min(sa+a[s] , sa+a[s]/2+da);
	dp[s][1][0] = sb+b[s]/2;
	dp[s][1][1] = min(sb+b[s] , sb+b[s]/2+db);
}

int main()
{
	int i;
	while (~scanf("%d",&n))
	{
		for (i = 1 ; i <= n ; i++)scanf("%d",a+i);
		for (i = 1 ; i <= n ; i++)scanf("%d",b+i);
		for (i = 1 ; i < n ; i++)
		{
			int s , e;
			scanf("%d%d",&s,&e);
			son[s].push_back(e);
			son[e].push_back(s);
		}
		Dfs(1,0);
		printf("%d\n",min(dp[1][0][1] , dp[1][1][1]));
		for (i = 1 ; i <= n ; i++)son[i].clear();
	}
	return 0;
}