int n = sizeof(arr)/sizeof(arr[0]);
const cur = nums[i]; // 当前遍历的元素
。快连下载-Letsvpn下载对此有专业解读
The algorithm walks the tree recursively. At each node, it checks: does this node's bounding box overlap with the query rectangle? If not, the entire subtree gets pruned (skipped). If it does overlap, it tests the node's points against the query and recurses into the children.
12:15, 27 февраля 2026Мир