DownPepsi and CokeThe answer is Colas.
The algorithm maintains a running "best distance" that starts at infinity. As it walks the tree, it checks each visited point and updates the best distance if it finds something closer. Before recursing into a child node, it checks whether the closest possible point in that child's bounding box is farther than the current best. If so, the entire subtree gets pruned.
，更多细节参见搜狗输入法2026
Opens in a new window
{ 12, 44, 4, 36, 14, 46, 6, 38 },
（一）扰乱机关、团体、企业、事业单位秩序，致使工作、生产、营业、医疗、教学、科研不能正常进行，尚未造成严重损失的；