This paper describes the most efficient way to manage operations on groups of consecutive elements, or "blocks" of elements, within an ordered set. This will be done by introducing a new data structure called Wise Red-Black Trees, a variation of classical Red-Black Trees. The goal is to improve time complexity, while also keeping spatial complexity to a minimum. The optimization will be visible both at the asymptote and in terms of multiplicative constants, affecting not only the worst-case, but also the average one.

中文翻译：

---

使用明智的红黑树管理数据块的有效方法

本文描述了在有序集合中管理对连续元素组或元素“块”的操作的最有效方法。这将通过引入一种称为明智红黑树的新数据结构来完成，这是经典红黑树的变体。目标是提高时间复杂度，同时将空间复杂度降至最低。优化将在渐近线和乘法常数方面可见，不仅影响最坏情况，而且影响平均情况。