"碾压大部分做法"
by 徐崇瑜 @ 2023-02-08 19:15:50
赞
by 徐崇瑜 @ 2023-02-08 19:16:07
树状数组最多有$O(n\log{\frac{n+v}{n}})$个节点
合并的时候启发式合并一个节点最多合并logn次
感觉$O(n\log{\frac{n+v}{n}}\log n)$
by Killer_joke @ 2023-02-08 19:17:53