![](https://img-blog.csdnimg.cn/2019091813595558.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
数据结构优化dp
文章平均质量分 91
数据结构优化dp
_sky123_
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #737 (Div. 2) D. Ezzat and Grid
题目链接Moamen was drawing a grid of nnn rows and 10910^9109 columns containing only digits 000 and 111. Ezzat noticed what Moamen was drawing and became interested in the minimum number of rows one needs to remove to make the grid beautiful.A grid is beauti原创 2021-08-11 23:53:15 · 169 阅读 · 0 评论 -
Educational Codeforces Round 85 (Rated for Div. 2) F. Strange Function
题目链接Let’s denote the following function fff. This function takes an array aaa of length nnn and returns an array. Initially the result is an empty array. For each integer iii from 111 to nnn we add element aia_iai to the end of the resulting array if it原创 2021-02-24 23:56:47 · 136 阅读 · 0 评论 -
2020-2021 ICPC, NERC, Southern and Volga Russian Regional Contest A. LaIS
题目链接Let’s call a sequence b1,b2,b3…,bk−1,bkb_1, b_2, b_3 \dots, b_{k - 1}, b_kb1,b2,b3…,bk−1,bk almost increasing if min(b1,b2)≤min(b2,b3)≤⋯≤min(bk−1,bk).\min(b_1, b_2) \le \min(b_2, b_3) \le \dots \le \min(b_{k - 1}, b_k).min(b1,b2)≤min(b2,b3原创 2021-02-03 22:53:09 · 554 阅读 · 0 评论 -
Bicolored Segments
You are given nnn segments [l1,r1],[l2,r2],…,[ln,rn][l_1,r_1],[l_2,r_2],…,[l_n,r_n][l1,r1],[l2,r2],…,[ln,rn]. Each segment has one of two colors: the iii-th segment’s color is tit_iti.Let’s call a pair of segments iii and jjj bad if the following t原创 2020-08-10 19:29:42 · 273 阅读 · 0 评论