user资讯

Жители Санкт-Петербурга устроили «крысогон»17:52

Москвичей предупредили о резком похолодании09:45

，更多细节参见爱思助手下载最新版本

问题只在于，大多数普通用户其实卡在门外。

Notice how the highlighted region shrinks at each step. The algorithm never examines points outside the narrowing window. In a balanced tree with nnn points, this takes about log⁡4(n)\log_4(n)log4​(n) steps. For a million points, that's roughly 10 steps instead of a million comparisons.