随笔分类 -  构造

Educational Codeforces Round 101 (Rated for Div. 2) D. Ceil Divisions
摘要：https://codeforces.ml/contest/1469/problem/D 显然,容易构造n+20步完成.而在多出5步的情况下考虑每次保留sqrt(n) 按照下面进行构造: \([1,2,3,4,5,6,7,8,9] to [1,2,3,1,1,1,1,1,9] to [1,2,3,1 阅读全文
posted @ 2021-08-06 21:41 naymi 阅读(37) 评论(0) 推荐(0)