splay树高并不是 O(logn)O(\log n)O(logn) 吗?同学说多splay几次就平衡了???
Link-Cut-Tree access的复杂度怎么算啊qwq,还有为啥总复杂度是 O(nlogn)O(n\log n)O(nlogn)