随笔分类 -  OnlineJudge - Codeforces

Codeforces - Avito Code Challenge 2018
摘要：与红橙dalao同台竞(bei)技(nve) 阅读全文
posted @ 2018-05-28 08:46 VisJiao 阅读(509) 评论(0) 推荐(0)
Codeforces834D - The Bakery
摘要：发现w的规律，用线段树优化转移 阅读全文
posted @ 2018-05-24 11:02 VisJiao 阅读(221) 评论(0) 推荐(0)
Codeforces963B - Destruction of a Tree
摘要：神奇的思路题！ 阅读全文
posted @ 2018-05-23 11:41 VisJiao 阅读(335) 评论(0) 推荐(1)
Codeforces787D - Legacy
摘要：线段树优化建图+最短路 阅读全文
posted @ 2018-05-05 23:05 VisJiao 阅读(461) 评论(0) 推荐(0)
Codeforces633G - Yash And Trees
摘要：`bitset`好强呀(✧◡✧) 阅读全文
posted @ 2018-04-19 10:04 VisJiao 阅读(163) 评论(0) 推荐(0)
Codeforces474E - Pillars
摘要：用树状数组/线段树来优化DP的转移 阅读全文
posted @ 2018-03-31 23:38 VisJiao 阅读(415) 评论(0) 推荐(0)
Codeforces603E - Pastoral Oddities
摘要：用set记录link/cut tree 阅读全文
posted @ 2018-03-15 13:21 VisJiao 阅读(324) 评论(0) 推荐(1)
Codeforces225B - Well-known Numbers
摘要：用k-bonacci数表示x 阅读全文
posted @ 2018-03-13 11:54 VisJiao 阅读(227) 评论(1) 推荐(0)
Codeforces225E - Unsolvable
摘要：推导得知答案与梅森数有关 阅读全文
posted @ 2018-03-13 10:04 VisJiao 阅读(230) 评论(0) 推荐(0)
Codeforces396A - On Number of Decompositions into Multipliers
摘要：将大数m分解成n个数 阅读全文
posted @ 2018-03-06 14:23 VisJiao 阅读(191) 评论(0) 推荐(0)
Codeforces446C - DZY Loves Fibonacci Numbers
摘要：利用斐波那契数列的性质维护线段树 阅读全文
posted @ 2018-03-03 22:27 VisJiao 阅读(729) 评论(2) 推荐(2)
Codeforces475D - CGCDSSQ
摘要：用map来DP 阅读全文
posted @ 2018-03-02 17:22 VisJiao 阅读(159) 评论(0) 推荐(0)
Codeforces348C - Subset Sums
摘要：这大概不算分块吧...只不过是sqrt(n) 阅读全文
posted @ 2018-03-02 11:15 VisJiao 阅读(201) 评论(0) 推荐(0)
Codeforces785E - Anton and Permutation
摘要：用分块代替树套树！ 阅读全文
posted @ 2018-03-02 08:41 VisJiao 阅读(223) 评论(0) 推荐(0)
Codeforces13E - Holes
摘要：分块入门题目 阅读全文
posted @ 2018-03-01 22:23 VisJiao 阅读(155) 评论(0) 推荐(0)