摘要：#include<cstdio> #include<cmath> #include<algorithm> using namespace std; typedef long long ll; typedef double db; const db Pi = acos(-1); const db in 阅读全文

摘要：#include<cstdio> const int N = 1e6 + 5; struct Trie{ int root, id; bool bit[32]; struct Node{ int val, siz, ch[2]; Node(){ ch[0] = ch[1] = -1, val = s 阅读全文

摘要：struct BIT{ #define maxn 1000 int n, m; int d1[maxn][maxn], d2[maxn][maxn], d3[maxn][maxn], d4[maxn][maxn], c[maxn][maxn]; inline void init(int x, int 阅读全文

摘要：struct ScopeGoat_Tree{ #define ls p[x].son[0] #define rs p[x].son[1] #define N 100005 const double alpha = 0.75; int rt, tot, cnt; int cur[N], res[N]; 阅读全文

摘要：注意确保操作合法性，否则可能陷入死循环 以点权作为排序依据 struct Splay{ #define ls p[u].son[0] #define rs p[u].son[1] #define maxn 100000 int root, cnt; struct Node{ int val, fa, 阅读全文