摘要：Feature Priority queue is based on the ADT heap . And heap has its unique advantange about maintaining the property with its property in $\Theta(\log 阅读全文

摘要：Feature To manage the elements grouping, we adopt this kind of special data structure. And it's based on the tree data structure. There are two main o 阅读全文

摘要：Feature Segment tree is derived from the RMQ question, which use segment tree to speed up the updating sparse table process. RMQ Definition: range min 阅读全文

摘要：Feature AVL is a kind of highly balanced binary search tree . "Highly balanced" means that every node, its difference between the depth of its left ch 阅读全文

摘要：Feature To deal with dynamic continuous and query problem, and for a given array: $A_1, A_2, \dotsc A_n$, we're asked to support these two operations: 阅读全文