![](https://img-blog.csdnimg.cn/20190927151053287.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
分块
.
鸡冠花12138
这个作者很懒,什么都没留下…
展开
-
分块算法
转载:https://blog.csdn.net/a_forever_dream/article/details/80054800首先,它会将一个序列分成√n 块,除了最后一块,其他每一块都严格的只有 √n 个元素,然后用一个belong数组记录每一个元素属于哪一块,再用l[i],r[i]记录每一块的左边界和右边界,然后就是......好像没了额......没错,就是这么简单,接下来...转载 2019-04-12 20:15:19 · 430 阅读 · 0 评论 -
1057 Stack
1057Stack(30分)Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push (inserting an element onto the t...原创 2019-04-12 20:16:35 · 223 阅读 · 0 评论