ACM - 树形DP
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
POJ - 1463 Strategic game(树形DP)
Strategic gameDescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the follow原创 2017-10-09 19:13:54 · 329 阅读 · 0 评论 -
HDU - 2196 Computer(树形DP)
ComputerProblem DescriptionA school bought the first computer some time ago(so this computer's id is 1). During the recent years the school bought N-1 new computers. Each new computer was co原创 2017-10-09 21:41:09 · 323 阅读 · 3 评论 -
POJ - 1192 最优连通子集 (树形DP)
最优连通子集Description众所周知,我们可以通过直角坐标系把平面上的任何一个点P用一个有序数对(x, y)来唯一表示,如果x, y都是整数,我们就把点P称为整点,否则点P称为非整点。我们把平面上所有整点构成的集合记为W。 定义1 两个整点P1(x1, y1), P2(x2, y2),若|x1-x2| + |y1-y2| = 1,则称P1, P2相邻,记作P1~P原创 2017-10-10 13:56:22 · 354 阅读 · 0 评论 -
POJ - 1947 Rebuilding Roads(树上背包)
Rebuilding RoadsDescriptionThe 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 t原创 2017-10-10 15:23:10 · 299 阅读 · 0 评论 -
牛客国庆集训派对Day3 B-Tree (树上包含某个节点的连通子集个数)
链接:https://www.nowcoder.com/acm/contest/203/B来源:牛客网 题目描述修修去年种下了一棵树,现在它已经有n个结点了。修修非常擅长数数,他很快就数出了包含每个点的连通点集的数量。澜澜也想知道答案,但他不会数数,于是他把问题交给了你。输入描述:第一行一个整数n (1≤ n ≤ 106),接下来n-1行每行两个整数ai,bi表示一条边 ...原创 2018-10-03 18:37:21 · 569 阅读 · 0 评论