Naruto_____的专栏

主席树模板题#include using namespace std;const int MAXN = 100010;const int MAXM = MAXN * 25;int n, m, q, dex;int a[MAXN], sorted[MAXN], root[MAXN];int T[MAXM], lson[MAXM], rson[MAXM];void Init()

划分树模板题#include #include #include #include #include using namespace std;const int MAXN = 100010;int toleft[20][MAXN], val[20][MAXN];int sorted[MAXN];void BuildT(int tl, int tr, int i) {

void build_tree(int left, int right, int i) { if(left == right) { int val; scanf("%d", &val); n[i].nmax = n[i].nmin = val; return ; } int mid = (left + right) / 2; build_tree(left, mid, i

将h值与划分树的中间值作比较，不小于中间值的话，答案加上查询区间进入左子树的个数并进入右子树，否则直接进入左子树。（注：查询区间可能为空）#include #include #include #include using namespace std;const int MAXN = 100010;int val[20][MAXN], toleft[20][MAXN];int

Orz......#include using namespace std;const int MAXN = 60010;const int MAXQ = 10010;const int MAXM = 2500010;int n, m, dex;int a[MAXN], sorted[MAXN], root[MAXN], lower[MAXN], temp[MAXN];int

给一个不作更改的矩阵，多次查询子矩阵的最小值#include #include #include #include using namespace std;const int Max = 305;int n;struct Treex { int treey[Max << 2]; void Buildy(int l, int r, int i) { if(l == r)

二维bit + 尼姆博奕#include #include #include #define Max 510using namespace std;int n, m;int a[Max][Max];int c[Max][Max];int lowbit(int x) { return x & (-x);}int sum(int x, int y) { i