神龙老爹

分类

未归档(12)

/ 注册

全部文章（共11篇）

P3810 三维偏序

#include <bits/stdc++.h> using namespace std; const int N = 200100; int n, k; int sum[N], root[N], ans[N]; struct node { int l,r;//左子，右子 ...

2024-08-03

0 140

P3157 动态逆序对

#include <bits/stdc++.h> #define LL long long using namespace std; const int N = 100010; int sum[N * 400], lc[N * 400], rc[N * 400]; int root[N...

2024-08-03

0 147

P3380 树套树

#include <bits/stdc++.h> using namespace std; using LL = long long; const int N = 5e4 + 5; int n, m, cnt, totn; int lx[N], rx[N], op[N], b[N], k...

2024-08-03

0 141

P3332 K大数查询

#include <bits/stdc++.h> using namespace std; using LL = long long; const int N = 5e4 + 5; int n, m, cnt, totn; int lx[N], rx[N], op[N], b[N], k...

2024-08-03

0 143

P1972 HH的项链（在线做法）

#include <bits/stdc++.h> using namespace std; using LL = long long; const int N = 1e6 + 10; struct tree { int L; int R; int cnt; }t...

2024-08-03

0 138

P7424 天天爱射击

#include <bits/stdc++.h> using namespace std; using LL = long long; const int N = 200005; int n, m, cnt; int ans[N], rootr[N], root[N]; struct ...

2024-08-03

0 140

可持久化权值线段树（主席树）

#include <bits/stdc++.h> using namespace std; #define LL long long const LL N = 200005; struct tree {//L为左儿子， R为右儿子，sum为该节点的权值 int L; i...

2024-08-03

0 138

Mosaic

#include <bits/stdc++.h> using namespace std; const int N = 810; struct SNode { int l; int r; int max; int min; int getmid()...

C++ 线段树套线段树

2024-08-02

0 132

左偏树

#include <bits/stdc++.h> using namespace std; int fa[100005], lc[100005], rc[100005], a[100005], h[100005]; int n, m; int find(int x) { if(...

C++

2024-07-09

0 162

FHQ

#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 10; std::mt19937 rnd(std::random_device{}()); struct { int l, r; // 左右...

C++

2024-07-09

0 161