5年过渡期结束，不是终点，而是新的起点，新的出发。
cursor.execute("""，推荐阅读下载安装汽水音乐获取更多信息
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.，详情可参考Line官方版本下载
let closed = false;