1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222
| #include <iostream> #include <algorithm> #include <cstring> #include <cstdio>
using namespace std;
const int N = 50010, M = 38 * N, INF = 2e9;
struct node { int s[2], p; int val; int size; void init(int _val, int _p) { s[0] = s[1] = 0, p = _p, val = _val, size = 1; } } tr[M];
int idx;
int L[N << 2], R[N << 2], ROOT[N << 2];
int n, m; int a[N];
void pushup(int u) { tr[u].size = tr[tr[u].s[0]].size + tr[tr[u].s[1]].size + 1; }
void rotate(int x) { int y = tr[x].p, z = tr[y].p; int k = tr[y].s[1] == x; tr[z].s[tr[z].s[1] == y] = x, tr[x].p = z; tr[y].s[k] = tr[x].s[k ^ 1], tr[tr[x].s[k ^ 1]].p = y; tr[x].s[k ^ 1] = y, tr[y].p = x; pushup(y), pushup(x); }
void splay(int &root, int x, int k) { while(tr[x].p != k) { int y = tr[x].p, z = tr[y].p; if(z != k) { if((tr[z].s[1] == y) == (tr[y].s[1] == x)) rotate(y); else rotate(x); } rotate(x); } if(!k) root = x; }
void insert(int &root, int val) { int u = root, p = 0; while(u) p = u, u = tr[u].s[val > tr[u].val]; u = ++ idx; if(p) tr[p].s[val > tr[p].val] = u; tr[u].init(val, p); splay(root, u, 0); }
void build(int u, int l, int r) { L[u] = l, R[u] = r; insert(ROOT[u], -INF), insert(ROOT[u], INF); for(int i = l; i <= r; i ++) insert(ROOT[u], a[i]); if(l >= r) return; int mid = l + r >> 1; build(u << 1, l, mid); build(u << 1 | 1, mid + 1, r); }
void update(int &root, int y, int x) { int u = root; while(u) { if(tr[u].val == y) break; else if(tr[u].val < y) u = tr[u].s[1]; else u = tr[u].s[0]; } splay(root, u, 0); int l = tr[u].s[0], r = tr[u].s[1]; while(tr[l].s[1]) l = tr[l].s[1]; while(tr[r].s[0]) r = tr[r].s[0]; splay(root, l, 0), splay(root, r, l); tr[r].s[0] = 0; pushup(r), pushup(l); insert(root, x); }
void modify(int u, int pos, int x) { update(ROOT[u], a[pos], x); if(L[u] >= R[u]) return; int mid = L[u] + R[u] >> 1; if(pos <= mid) modify(u << 1, pos, x); else modify(u << 1 | 1, pos, x); }
int get_cnt(int u, int x) { int cnt = 0; while(u) { if(tr[u].val < x) cnt += tr[tr[u].s[0]].size + 1, u = tr[u].s[1]; else u = tr[u].s[0]; } return cnt; }
int get_pre(int u, int x) { int res = -INF; while(u) { if(tr[u].val < x) res = max(res, tr[u].val), u = tr[u].s[1]; else u = tr[u].s[0]; } return res; }
int get_suc(int u, int x) { int res = INF; while(u) { if(tr[u].val > x) res = min(res, tr[u].val), u = tr[u].s[0]; else u = tr[u].s[1]; } return res; }
int query_cnt(int u, int l, int r, int x) { if(L[u] >= l && R[u] <= r) return get_cnt(ROOT[u], x) - 1; int mid = L[u] + R[u] >> 1; int cnt = 0; if(l <= mid) cnt += query_cnt(u << 1, l, r, x); if(r > mid) cnt += query_cnt(u << 1 | 1, l, r, x); return cnt; }
int query_pre(int u, int l, int r, int x) { if(L[u] >= l && R[u] <= r) return get_pre(ROOT[u], x); int mid = L[u] + R[u] >> 1; int res = -INF; if(l <= mid) res = max(res, query_pre(u << 1, l, r, x)); if(r > mid) res = max(res, query_pre(u << 1 | 1, l, r, x)); return res; }
int query_suc(int u, int l, int r, int x) { if(L[u] >= l && R[u] <= r) return get_suc(ROOT[u], x); int mid = L[u] + R[u] >> 1; int res = INF; if(l <= mid) res = min(res, query_suc(u << 1, l, r, x)); if(r > mid) res = min(res, query_suc(u << 1 | 1, l, r, x)); return res; }
int main() { scanf("%d%d", &n, &m); for(int i = 1; i <= n; i ++) scanf("%d", &a[i]); build(1, 1, n); while(m --) { int op; scanf("%d", &op); if(op == 1) { int l, r, x; scanf("%d%d%d", &l, &r, &x); printf("%d\n", query_cnt(1, l, r, x) + 1); } else if(op == 2) { int l, r, k; scanf("%d%d%d", &l, &r, &k); int left = 0, right = 1e8; while(left < right) { int mid = left + right + 1 >> 1; if(query_cnt(1, l, r, mid) >= k) right = mid - 1; else left = mid; } printf("%d\n", right); } else if(op == 3) { int pos, x; scanf("%d%d", &pos, &x); modify(1, pos, x); a[pos] = x; } else if(op == 4) { int l, r, x; scanf("%d%d%d", &l, &r, &x); int res = query_pre(1, l, r, x); if(res == -INF) puts("-2147483647"); else printf("%d\n", res); } else if(op == 5) { int l, r, x; scanf("%d%d%d", &l, &r, &x); int res = query_suc(1, l, r, x); if(res == INF) puts("2147483647"); else printf("%d\n", res); } } return 0; }
|