![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划-树型DP
STILLxjy
不要让任何人打乱你生活的节奏
展开
-
(POJ 1947)Rebuilding Roads <树型DP>
Rebuilding Roads DescriptionThe cows have reconstructed Farmer John’s farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthquake last May. The cows didn’t have time to rebuild a原创 2017-01-10 19:26:58 · 365 阅读 · 0 评论 -
(HDU 1520)Anniversary party <树型DP> 公司开派对,上下级不能同时到
Anniversary party Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10356 Accepted Submission(s): 4366Problem Description There is going to原创 2017-03-03 23:10:58 · 717 阅读 · 0 评论 -
(HDU 3586 Information Disturbing) 树型DP
Information Disturbing Problem Description In the battlefield , an effective way to defeat enemies is to break their communication system. The information department told you that there are n enemy原创 2017-03-15 22:14:08 · 582 阅读 · 0 评论 -
(POJ 3107 Godfather)树型DP + 删点
Godfather Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6646 Accepted: 2338 DescriptionLast years Chicago was full of gangster fights and strange murders. The chief of the poli原创 2017-03-15 22:16:07 · 402 阅读 · 0 评论 -
(POJ 3140 Contestants Division)树型DP + 删边
Contestants Division Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 9909 Accepted: 2821 DescriptionIn the new ACM-ICPC Regional Contest, a special monitoring and submitting syst原创 2017-03-15 22:17:38 · 463 阅读 · 0 评论 -
(POJ 1655 Balancing Act)树型DP + 删点
Balancing Act Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13137 Accepted: 5548 DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1…N. Deleting any node原创 2017-03-15 22:19:29 · 431 阅读 · 0 评论 -
(POJ 2378 Tree Cutting)树型DP + 删点
Tree Cutting Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4512 Accepted: 2754 DescriptionAfter Farmer John realized that Bessie had installed a “tree-shaped” network among his原创 2017-03-15 22:21:03 · 517 阅读 · 0 评论 -
(cf 219D Choosing Capital for Treeland) 树型DP + 常规
Choosing Capital for Treelandtime limit per test:3 seconds memory limit per test:256 megabytesThe country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Ove原创 2017-03-15 22:25:18 · 692 阅读 · 0 评论 -
(HDU 2196) Computer <树型DP经典题目 & dfs> 求树上每个节点到最远的叶子结点的路径长度
Computer Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1232 Accepted Submission(s): 597Problem Description A school bought the first com原创 2017-03-03 23:06:02 · 866 阅读 · 0 评论