摘要:
description "洛谷" data range $$ n\le 5\times 10^4$$ solution 这就是四维偏序了... 好象时间复杂度是$O(n^{\frac{5}{3}})$... 因为可以剪枝所以速度快了一些... code cpp include include inc 阅读全文
摘要:
description "洛谷" data range $$ n\le 10^5,m\le 2\times 10^5$$ kd tree solution 直到现在才开始做三维偏序...还是用的$kd tree$... 险险卡过.jpg ![][1] code cpp include include 阅读全文