题意:给定一棵树,求树的最小点覆盖(覆盖所有边的最少点数)
思路:在最小点覆盖中,对于每条边,至少有一个点属于标记集合里。每个点设置两个状态,dp[i][0]表示不选该点时其子树的最小点覆盖数,dp[i][1]表示选了该点子树的最小点覆盖数,则dp[i][0] = dp[i][0] + dp[j][1]表示若该点不选,则其子节点必选,dp[i][1] = dp[i][1] + min(dp[j][1], dp[j][0]) + 1,表示选或不选其子树中最小值,且再加上这个点。从根节点遍历,求出选或不选根节点时的最小值即可。输入格式真的是坑,必须用scanf不能用cin,不然疯狂WA
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;
const int maxn = 1e5+5;
int n, dp[maxn][2];
vector<int> g[maxn];
void dfs(int u)
{
dp[u][1] = 1;
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i];
dfs(v);
dp[u][0] += dp[v][1];
dp[u][1] += min(dp[v][0], dp[v][1]);
}
// printf("dp[%d][0]:%d, dp[%d][1]:%d\n", u, dp[u][0], u, dp[u][1]);
}
int main()
{
// freopen("test.txt", "r", stdin);
while (cin >> n) {
memset(dp, 0, sizeof(dp));
int root = -1;
for (int i = 0; i < n; i++) {
int u, t;
scanf("%d:(%d)", &u , &t);
g[u].clear();
if (root == -1)
root = u;
for (int j = 0; j < t; j++) {
int v;
scanf("%d", &v);
g[u].push_back(v);
}
}
dfs(root);
cout << min(dp[root][0], dp[root][1]) << endl;
}
return 0;
}
也可以用贪心法求,从dfs逆序开始判断,若当前节点及节点的父亲不在点覆盖集合里,就将其放入集合,标记该点及其父亲,若某点父亲已经在集合里,那该点必定已经被覆盖过了
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
using namespace std;
const int maxn = 1e5+5;
int pre[maxn], vis[maxn], pos[maxn], s[maxn], set[maxn], now, n, m;
vector<int> g[maxn];
void dfs(int x)
{
pos[now++] = x;
for (int i = 0; i < g[x].size(); i++) {
if (!vis[g[x][i]]) {
vis[g[x][i]] = 1;
pre[g[x][i]] = x;
dfs(g[x][i]);
}
}
}
int solve()
{
memset(s, 0, sizeof(s));
memset(set, 0, sizeof(set));
int ans = 0;
for (int i = n-1; i >= 0; i--) {
int t = pos[i];
if (!s[t] && !s[pre[t]]) {
set[pre[t]] = 1;
ans++;
s[t] = 1;
s[pre[t]] = 1;
}
}
return ans;
}
int main()
{
// freopen("test.txt", "r", stdin);
while (cin >> n) {
memset(vis, 0, sizeof(vis));
now = 0;
vis[0] = 1;
pre[0] = 1;
int root = -1;
for (int i = 0; i < n; i++)
g[i].clear();
for (int i = 0; i < n; i++) {
int u, t;
scanf("%d:(%d)", &u , &t);
if (root == -1)
root = u;
for (int j = 0; j < t; j++) {
int v;
scanf("%d", &v);
g[u].push_back(v);
g[v].push_back(u);
}
}
dfs(0);
cout << solve() << endl;
}
return 0;
}