题目链接:
SPOJ PT07X Vertex Cover
题意:
一个无向无环图,给
n
个节点和
数据范围:
n≤105
分析:
对于节点
i
,定义
状态转移方程:
dp[u][1]=∑min(dp[v][0],dp[v][1]),v是u的子节点
需要在 dfs 记录从父节点转移时父节点的父节点是谁,防止死循环。选择任意点为起点递归应该都可以。
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
const int MAX_N = 100010;
int n, total;
int head[MAX_N], dp[MAX_N][2], vis[MAX_N];
struct Edge {
int to, next;
}edge[MAX_N * 2];
inline void AddEdge(int from, int to)
{
edge[total].to = to;
edge[total].next = head[from];
head[from] = total++;
}
void dfs(int u, int p)
{
if (vis[u]) return;
vis[u] = 1;
dp[u][1] = 1, dp[u][0] = 0;
for (int i = head[u]; i != -1; i = edge[i].next) {
int v = edge[i].to;
if (v == p) continue;
dfs(v, u);
dp[u][0] += dp[v][1];
dp[u][1] += min(dp[v][1], dp[v][0]);
}
}
int main()
{
while (~scanf("%d", &n)) {
memset(head, -1, sizeof(head));
total = 0;
for (int i = 1; i < n; ++i) {
int u, v;
scanf("%d%d", &u, &v);
AddEdge(u, v);
AddEdge(v, u);
}
memset(vis, 0, sizeof(vis));
dfs(1, 0);
printf("%d\n", min(dp[1][0], dp[1][1]));
}
return 0;
}