萌新求助kdT复杂度

P4148 简单题

zhendelan @ 2021-01-15 16:55:34

怎么证明查询矩形的复杂度是O(\sqrt n)?

还有怎么证明查询k维的时候是O(n^{1-\frac 1 k})
求大佬解答


by command_block @ 2021-01-15 16:59:53

https://www.luogu.com.cn/blog/command-block/kdt-xiao-ji


by zhendelan @ 2021-01-15 17:03:26

@command_block

cmd写的太好了,看懂了。

此帖完结


|