dp - 随笔分类 - tarjan's

codeforces1029 E.Tree with Small Distances

摘要："题目链接" 题意：给出一个 $n$ 个结点的树，问如何选择结点进行连线使得结点$1$到其他所有结点的最短距离都小于等于 $2$ 。题解：这道题倒是自己想出来了。首先有个结论：连线都是从结点1向其他结点连线，因为这样总是最优的。由题意可知，当结点$1$向某个节点 $u$ 连线后，与结点 $u$ 阅读全文

posted @ 2018-08-30 20:39 tarjan's 阅读(136) 评论(0) 推荐(0)

hdu 5534 Partial Tree(dp+降唯，好题)

摘要："题目链接" Partial Tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1577 Accepted Submission(s 阅读全文

posted @ 2017-10-03 18:10 tarjan's 阅读(122) 评论(0) 推荐(0)

codeforces 651E. Table Compression(强连通分量缩点，拓扑排序，dp)

摘要："题目链接" E. Table Compression time limit per test4 seconds memory limit per test256 megabytes inputstandard input outputstandard output Little Petya is 阅读全文

posted @ 2017-09-06 16:17 tarjan's 阅读(158) 评论(0) 推荐(0)

hdu 5745La Vie en rose(dp+bitset优化)

摘要："题目链接" La Vie en rose Time Limit: 7000/3500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3188 Accepted Submission(s 阅读全文

posted @ 2017-09-03 21:43 tarjan's 阅读(123) 评论(0) 推荐(0)

codeforces 789E. The Great Mixing(想法，图论／bitset+dp)

摘要：题目链接 E. The Great Mixing time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Sasha and Kolya deci 阅读全文

posted @ 2017-09-01 19:45 tarjan's 阅读(33) 评论(0) 推荐(0)

codeforces 822 E. Liar(后缀数组+dp，好题)

摘要："题目链接" E. Liar time limit per test4 seconds memory limit per test256 megabytes inputstandard input outputstandard output The first semester ended. You 阅读全文

posted @ 2017-08-30 21:57 tarjan's 阅读(342) 评论(0) 推荐(0)

codeforces 842C. Ilya And The Tree(dfs，dp)

摘要："题目链接" C. Ilya And The Tree time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Ilya is very fon 阅读全文

posted @ 2017-08-30 14:18 tarjan's 阅读(189) 评论(0) 推荐(0)

hdu 6161Big binary tree(hash+dp)

摘要：题目链接 Big binary tree Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 250 Accepted Submission(s): 阅读全文

posted @ 2017-08-23 15:47 tarjan's 阅读(27) 评论(0) 推荐(0)

codeforces 677D. Vanya and Treasure(dp+bfs,黑科技)

该文被密码保护。

posted @ 2017-08-18 12:22 tarjan's 阅读(1) 评论(0) 推荐(0)

codeforces 744C(状压dp)

该文被密码保护。

posted @ 2017-08-16 11:49 tarjan's 阅读(1) 评论(0) 推荐(0)

codeforces 838E. Convex Countour(dp)

该文被密码保护。

posted @ 2017-08-12 20:17 tarjan's 阅读(1) 评论(0) 推荐(0)

codeforces 834D. The Bakery(dp+线段树,好题)

该文被密码保护。