树形DP,(mark)
//============================================================================
// Name : hello.cpp// Author : key
// Version : ∞
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define NUM_INF 0x7fffffff
struct Node{
int v;
int nex;
};
Node m_Node[21000];
int m_Node_num;
int mark[21000];
int dp[21000][3];
int degree[21000];
int My_min(int a,int b)
{
return a<b?a:b;
}
void dfs(int u,int u_next)
{
if(u != 1 && degree[u] == 1)
{
dp[u][0] = 1;
dp[u][1] = NUM_INF;
dp[u][2] = 0;
return ;
}
dp[u][0] = 1;
int i;
int v;
int temp_min,num_min;
int sign;
for(
i=mark[u],sign=0,temp_min=NUM_INF;
i != -1;
i = m_Node[i].nex
)
{
v = m_Node[i].v;
if(v == u_next)
continue;
dfs(v,u);
dp[u][0] += My_min(My_min(dp[v][0],dp[v][1]),dp[v][2]);
if(dp[v][0]<=dp[v][1])
{
dp[u][1] += dp[v][0];
sign = 1;
}
else
{
dp[u][1] += dp[v][1];
if(temp_min>dp[v][0])
{
temp_min = dp[v][0];
num_min = dp[v][1];
}
}
dp[u][2] += My_min(dp[v][0],dp[v][1]);
}
if(!sign)
{
dp[u][1] += temp_min-num_min;
}
}
int main()
{
int n;
int a,b;
int i,j;
while(scanf("%d",&n)!=EOF)
{
m_Node_num = 0;
memset(mark,255,sizeof(mark));
memset(dp,0,sizeof(dp));
memset(degree,0,sizeof(degree));
n--;
for(i=0;i<n;i++)
{
scanf("%d%d",&a,&b);
m_Node[m_Node_num].v = a;
m_Node[m_Node_num].nex = mark[b];
mark[b] = m_Node_num++;
degree[a]++;
m_Node[m_Node_num].v = b;
m_Node[m_Node_num].nex = mark[a];
mark[a] = m_Node_num++;
degree[b]++;
}
if(1==n)
{
printf("0\n");
return 0;
}
dfs(1,0);
printf("%d\n",My_min(dp[1][0],dp[1][1]));
}
return 0;
}
Cell Phone Network