树形dp
newhonor
可以不伟大,但不能卑微
展开
-
E. Paint the Tree
http://codeforces.com/contest/1241/problem/E#include <bits/stdc++.h>//#include <queue>//#include <cmath>//#include <iostream>//#include <unordered_map>#define ls...原创 2019-11-05 17:15:43 · 145 阅读 · 0 评论 -
Cell Phone Network
https://ac.nowcoder.com/acm/contest/1069/A总结:树形dp;dp[u][0]表当前节点u建站点最少数目;dp[u][1]表示u的子节点有建,u不建;dp[u][2]表示u能被父节点覆盖,不建;#include <iostream>#include <cstring>#include <queue>#in...原创 2019-07-30 11:24:18 · 341 阅读 · 0 评论 -
Anniversary party
http://acm.hdu.edu.cn/showproblem.php?pid=1520思路:树形dp;dp[u][0]表示不选u,dp[u][1]表示选u#include <iostream>#include <cstring>#include <queue>#include <vector>#include <alg...原创 2019-07-30 16:35:59 · 112 阅读 · 0 评论 -
Strategic Game
http://acm.hdu.edu.cn/showproblem.php?pid=1054思路:dp[u][1/0]表示选不选u节点#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#i...原创 2019-07-30 17:24:37 · 116 阅读 · 0 评论 -
1531 树上的博弈
https://www.51nod.com/Challenge/Problem.html#problemId=1531#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <...原创 2019-09-20 23:47:57 · 105 阅读 · 0 评论