传送门:HDU-4714
题意:一棵树有n个节点,有2种操作:①删除1条边;②添加1条边。每次操作花费为1,要求用最小花费使得这棵树变成一个环:整个图有n条边,每个点的度为2且构成1个联通块
题解:树型dp
dp以u为根节点的子树时时记录2种状态:①将子树变成一条链且其中一端为u的最小花费;②将子树变成一条链的最小花费
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MX = 1e6 + 5;
const int inf = 0x3f3f3f3f;
struct Edge {
int v, nxt;
} E[MX * 2];
int head[MX], tot, n, m;
void add(int u, int v) {
E[tot].v = v;
E[tot].nxt = head[u];
head[u] = tot++;
}
void init() {
for (int i = 1; i <= n; i++) head[i] = -1;
tot = 0;
}
int f[MX], dp[MX];
void dfs(int u, int fa) {
f[u] = dp[u] = 0;
int cnt1 = inf, cnt2 = inf, sz = 0;
for (int i = head[u]; ~i; i = E[i].nxt) {
int v = E[i].v;
if (v == fa) continue;
dfs(v, u);
f[u] += dp[v];
dp[u] += dp[v];
if (f[v] - dp[v] < cnt1) {
cnt2 = cnt1;
cnt1 = f[v] - dp[v];
} else if (f[v] - dp[v] < cnt2) cnt2 = f[v] - dp[v];
sz++;
}
if (sz > 0) {
f[u] = min(f[u] + 2 * sz, f[u] + cnt1 + 2 * (sz - 1));
dp[u] = min(dp[u] + 2 * sz, dp[u] + min(cnt1 + cnt2 + 2 * (sz - 2), cnt1 + 2 * (sz - 1)));
}
}
int main() {
int T;
//freopen("in.txt", "r", stdin);
scanf("%d",&T);
while (T--) {
scanf("%d", &n);
init();
for (int i = 1, u, v; i < n; i++) {
scanf("%d%d", &u, &v);
add(u, v); add(v, u);
}
dfs(1, -1);
printf("%d\n", dp[1] + 1);
}
return 0;
}