摘要：**1. fhq-treap实现** ```cpp #include //平衡树的区间修改 #define rep(i, a, b) for(int i = (a); i = (b); i--) #define Ede(i, u) for(int i = h[u]; i; i = ne[i]) #d 阅读全文

摘要：```cpp #include #define rep(i, a, b) for(int i = (a); i = (b); i--) #define Ede(i, u) for(int i = h[u]; i; i = ne[i]) #define go(i, a) for(auto i : a) 阅读全文