დ♂Hany01's Blog Space♂ღ

静态splay//Au: Hany01 //Prob: Splay //Date: Dec 3rd, 2017 //Email: hany01@foxmail.com#include<bits/stdc++.h>using namespace std;typedef long long LL; typedef pair<int, int> PII; typedef vector<int> VI;#d

Description click me Solution 每次合并时考虑将较小的Splay中的节点依次插入较大的Splay中，发现每个点最多会被插入log2nlog2nlog_2n次，时间复杂度为O(nlog22n)O(nlog22n)O(nlog^2_2n) Source /************************************************ * A...