树形Dp
文章平均质量分 79
ysy20021208
一人饮酒,一人醉
展开
-
树形Dp——扭一扭 poj 1655 Balancing Act
Balancing Act Time Limit: 1000MS Memory Limit: 65536K Description Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a fo原创 2017-08-18 19:01:35 · 97 阅读 · 0 评论 -
树形Dp——POJ 1463 Strategic game
Strategic game Time Limit: 2000MS Memory Limit: 10000K Description Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fas原创 2017-08-15 17:21:49 · 94 阅读 · 0 评论 -
树形Dp——poj3342
Party at Hali-Bula Time Limit: 2000MS Memory Limit: 65536K Description Dear Contestant, I'm going to have a party at my villa at Hali-Bula to celebrate my retirement from B原创 2017-08-15 15:49:32 · 106 阅读 · 0 评论 -
LCA——JD 3055 Nearest Common Ancestors
3055: Nearest Common Ancestors Time Limit: 1 Sec Memory Limit: 128 MB Description 给定N个节点的一棵树,有K次查询,每次查询a和b的最近公共祖先。 样例中的16和7的公共祖先(LCA:Least Common Ancestors)是4。 Input 第一行两个整数N(1 5)、K(1原创 2017-08-14 09:55:27 · 120 阅读 · 0 评论 -
树形Dp——poj2486 Apple Tree
Apple Tree Time Limit: 1000MS Memory Limit: 65536K Description Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in th原创 2017-08-13 10:02:12 · 140 阅读 · 0 评论 -
LCA——JD 3055 Nearest Common Ancestors (Tarjon做法(离线))
Nearest Common Ancestors Time Limit: 1 Sec Memory Limit: 128 MB Description 给定N个节点的一棵树,有K次查询,每次查询a和b的最近公共祖先。 样例中的16和7的公共祖先(LCA:Least Common Ancestors)是4。 Input 第一行两个整数N(1 5)、K(1 5) 第原创 2017-08-19 11:22:22 · 78 阅读 · 0 评论