Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
我刚读完段树，时间复杂度为 O(log n) 的插入证明非常有说服力，但我无法弄清楚如何以相同的复杂度执行删除。我还尝试搜索提出分段树但找不到的论文，如果有人有，您可以发布链接。“JL Bentley，Klee 矩形问题的算法。技术报告”