Perfect Service UVA - 1218

按照紫书的思路，递归求解，其中注意要将u不是服务器的两种情况进行合并，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
using namespace std;

int flag,N;
bool visit[10100];
int result[10100][3];

void dp(int u,vector<int>* edge){
	visit[u] = true;
	result[u][0] = 1;
	result[u][1] = 0;
	result[u][2] = 11000;
	for (int i = 0; i < edge[u].size(); i++){
		int ind = edge[u][i];
		if (!visit[ind]){
			dp(ind,edge);
			result[u][0] += min(result[ind][0], result[ind][1]);
			result[u][1] += result[ind][2];
			result[u][2] = min(result[u][2],result[ind][0]-result[ind][2]);
		}
	}
	result[u][2] += result[u][1];
}

int main(){
	flag = 0;
	while (flag+1&&cin >> N){
		if (N == -1) break;
		vector<int> edge[10100];
		for (int i = 1; i < N; i++){
			int a, b;
			cin >> a >> b;
			edge[a].push_back(b);
			edge[b].push_back(a);
		}
		memset(visit, 0, sizeof(visit));
		memset(result,0,sizeof(result));
		dp(1, edge);
		cout << min(result[1][0], result[1][2])<<endl;
		cin >> flag;
	}
	return 0;
}