随笔分类 -  平衡树

摘要:#include<bits/stdc++.h> #define LL long long #define pii pair<int,int> #define mp make_pair using namespace std; const int maxx = 2e5+6; const double alpha = 0.75; struct node{ int l,ml,mr,r; int val[ 阅读全文
posted @ 2019-08-31 21:49 bluefly-hrbust 阅读(282) 评论(0) 推荐(0)
摘要:怎么代码都这么长。。。 阅读全文
posted @ 2019-08-24 22:57 bluefly-hrbust 阅读(162) 评论(0) 推荐(0)
摘要:替罪羊树,代码贼长,我哭了。。。 #include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<vector>using namespace std;const int maxn = 1e5+5;co 阅读全文
posted @ 2019-08-24 17:16 bluefly-hrbust 阅读(249) 评论(0) 推荐(0)