搜索资源列表
SBT
- 利用线段树套平衡树查询区间第K大数，并满足修改操作，复杂度log^2(n)-Balanced tree using segment tree sets large numbers query interval s K, and operations to meet the changes, the complexity of log ^ 2 (n)
SBT
- the describe of SBT in chinese it may help you to learn the SBT
structure
- 各种各样的高级数据结构原理以及C++实现，例如红黑树，哈希表，笛卡尔树，字典树，斐波那契堆，二叉堆，SBT等等。-The wide range of advanced data structural principle C++ of implementation, such as red-black trees, hash tables, Cartesian tree dictionary tree, Fibonacci heap, binary heap, SBT and so on.
SBT
- SBT的基本操作，个类oj题目，有源代码，可以相互学习-SBT' s basic operations, a class oj topic, source code, you can learn from each other
data-structure
- 提供Splay、SBT、线段树、动态树等数据结构的模板，方便直接套用-The structure of data provided by Splay, SBT, dynamic segment tree, tree template, convenient to directly use