摘要: 【模板】普通平衡树 FHQ treap code const int N = 1e5 + 10; int n; int root, idx; struct FHQ { int l, r, siz, key, val; }tr[N]; int nwid(int x) { idx ++ ; tr[idx 阅读全文
posted @ 2022-12-09 09:49 kroyosh 阅读(38) 评论(0) 推荐(0)