https://wiki.cvbbacm.com/ 2026-05-25T21:11:50+0800 https://wiki.cvbbacm.com/ https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico text/html 2020-05-15T11:22:00+0800 Anonymous (anonymous@undisclosed.example.com) https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:alchemist:maxdumbledore:cplusplus:rope&rev=1589512920&do=diff 洛谷3369 可持久化平衡树 #include "ext/rope" #include<cstdio> #include<algorithm> #include<iostream> using namespace std; using namespace __gnu_cxx; #define MAXN 500006 rope<int> nums[MAXN]; int n; int main() { cin >> n; for (int i = 1; i <= n; ++i) { int v, opt, x; scanf("%d%d%d", &v, &opt, &x); nums[i] = nums[v]; if (opt == 1) nums[i].insert(lower_bound(nums[i].begin(), nums[i].end(), x) - nums[i].begin(), x); if (opt == 2) { au…