献上数列分块入门题单
数列分块->优雅的暴力,根据题目可以按照或者log(n)作为一个块的大小,不同分块方法时间复杂度的瓶颈不同
区间加法,单点求值
AC代码:
#include <bits/stdc++.h> #define rep(i,a,n) for(int i=a;i<n;i++) using namespace std; using LL = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> a(n + 1), add(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i]; } int len = sqrt(n); function<int(int)> get = [&](int x) { return (x - 1) / len; }; function<void(int, int, int)> update = [&](int l, int r, int c) { if (get(l) == get(r)) { for (int i = l; i <= r; i++) { a[i] += c; } } else { int i = l, j = r; while (get(i) == get(l)) { a[i++] += c; } while (get(j) == get(r)) { a[j--] += c; } for (int k = get(i); k <= get(j); k++) { add[k] += c; } } }; function<int(int)> query = [&](int x) { return a[x] + add[get(x)]; }; for (int i = 0; i < n; i++) { char op; int l, r, c; cin >> op; cin >> l >> r >> c; if (op == '0') { update(l, r, c); } else { cout << query(r) << '\n'; } } return 0; }
区间加法,区间查询小于某个值的元素个数
AC代码:
#include <bits/stdc++.h> #define rep(i,a,n) for(int i=a;i<n;i++) using namespace std; using LL = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int len = sqrt(n); vector<int> a(n + 1), add(n + 1), L(n + 1, 0x3f3f3f3f); vector<vector<int>> v(n + 1); auto get = [&](int x) { return x / len; }; for (int i = 1; i <= n; i++) { cin >> a[i]; int x = get(i); L[x] = min(i, L[x]); v[x].push_back(a[i]); } for (int i = 0; i <= n / len; i++) { sort(v[i].begin(), v[i].end()); } function<void(int)> resort = [&](int x) { v[x].clear(); int i = L[x]; while (get(i) == x and i <= n) { v[x].push_back(a[i++]); } sort(v[x].begin(), v[x].end()); }; function<void(int, int, int)> update = [&](int l, int r, int c) { if (get(l) == get(r)) { for (int i = l; i <= r; i++) { a[i] += c; } resort(get(l)); } else { int i = l, j = r; while (get(i) == get(l)) { a[i++] += c; } while (get(j) == get(r)) { a[j--] += c; } resort(get(l)), resort(get(r)); for (int k = get(i); k <= get(j); k++) { add[k] += c; } } }; function<int(int, int, int)> query = [&](int l, int r, int c) { int ans = 0; if (get(l) == get(r)) { for (int i = l; i <= r; i++) { if (a[i] + add[get(i)] < c) { ans++; } } } else { int i = l, j = r; while (get(i) == get(l)) { if (a[i++] + add[get(l)] < c) { ans++; } } while (get(j) == get(r)) { if (a[j--] + add[get(r)] < c) { ans++; } } for (int k = get(i); k <= get(j); k++) { ans += lower_bound(v[k].begin(), v[k].end(), c - add[k]) - v[k].begin(); } } return ans; }; for (int i = 0; i < n; i++) { char op; int l, r, c; cin >> op >> l >> r >> c; if (op == '0') { update(l, r, c); } else { cout << query(l, r, c * c) << '\n'; } } return 0; }
区间加法,区间询问比某个值小的最大元素
AC代码:
#include <bits/stdc++.h> #define rep(i,a,n) for(int i=a;i<n;i++) using namespace std; using LL = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int len = sqrt(n); vector<int> a(n + 1), add(n + 1), L(n + 1, 0x3f3f3f3f); vector<vector<int>> v(n + 1); auto get = [&](int x) { return x / len; }; for (int i = 1; i <= n; i++) { cin >> a[i]; int x = get(i); L[x] = min(i, L[x]); v[x].push_back(a[i]); } for (int i = 0; i <= n / len; i++) { sort(v[i].begin(), v[i].end()); } function<void(int)> resort = [&](int x) { v[x].clear(); int i = L[x]; while (get(i) == x and i <= n) { v[x].push_back(a[i++]); } sort(v[x].begin(), v[x].end()); }; function<void(int, int, int)> update = [&](int l, int r, int c) { if (get(l) == get(r)) { for (int i = l; i <= r; i++) { a[i] += c; } resort(get(l)); } else { int i = l, j = r; while (get(i) == get(l)) { a[i++] += c; } while (get(j) == get(r)) { a[j--] += c; } resort(get(l)), resort(get(r)); for (int k = get(i); k <= get(j); k++) { add[k] += c; } } }; function<int(int, int, int)> query = [&](int l, int r, int c) { int ans = -1; if (get(l) == get(r)) { for (int i = l; i <= r; i++) { if (a[i] + add[get(i)] < c) { ans = max(ans, a[i] + add[get(i)]); } } } else { int i = l, j = r; while (get(i) == get(l)) { if (a[i++] + add[get(l)] < c) { ans = max(ans, a[i - 1] + add[get(l)]); } } while (get(j) == get(r)) { if (a[j--] + add[get(r)] < c) { ans = max(ans, a[j + 1] + add[get(r)]); } } for (int k = get(i); k <= get(j); k++) { int id = lower_bound(v[k].begin(), v[k].end(), c - add[k]) - v[k].begin(); if (id - 1 >= 0 and id - 1 < v[k].size() and v[k][id - 1] < c - add[k]) { ans = max(ans, v[k][id - 1] + add[k]); } } } return ans; }; for (int i = 0; i < n; i++) { char op; int l, r, c; cin >> op >> l >> r >> c; if (op == '0') { update(l, r, c); } else { cout << query(l, r, c) << '\n'; } } return 0; }
区间加法,区间求和
AC代码:
#include <bits/stdc++.h> #define rep(i,a,n) for(int i=a;i<n;i++) using namespace std; using LL = long long; #define int long long signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int len = sqrt(n); vector<int> a(n + 1), add(n + 1), sum(n + 1); auto get = [&](int x) { return x / len; }; for (int i = 1; i <= n; i++) { cin >> a[i]; int x = get(i); sum[x] += a[i]; } function<void(int, int, int)> update = [&](int l, int r, int c) { if (get(l) == get(r)) { for (int i = l; i <= r; i++) { a[i] += c; sum[get(l)] += c; } } else { int i = l, j = r; while (get(i) == get(l)) { a[i++] += c; sum[get(l)] += c; } while (get(j) == get(r)) { a[j--] += c; sum[get(r)] += c; } for (int k = get(i); k <= get(j); k++) { add[k] += c; sum[k] += c * len; } } }; function<int(int, int, int)> query = [&](int l, int r, int c) { int ans = 0; if (get(l) == get(r)) { for (int i = l; i <= r; i++) { ans += a[i] + add[get(l)]; } } else { int i = l, j = r; while (get(i) == get(l)) { ans += a[i++] + add[get(l)]; } while (get(j) == get(r)) { ans += a[j--] + add[get(r)]; } for (int k = get(i); k <= get(j); k++) { ans += sum[k]; } } return ans; }; for (int i = 0; i < n; i++) { char op; int l, r, c; cin >> op >> l >> r >> c; if (op == '0') { update(l, r, c); } else { c++; int ans = query(l, r, c) % c; cout << (ans + c) % c << '\n'; } } return 0; }
区间开方,区间求和
在区间开方时,在计算a[i]比原先少了多少时,要将sqrt()强制转换为int,否则在计算过程中是按照double类型计算,而在赋值时按照int赋值,会出现误差
AC代码:
#include <bits/stdc++.h> #define rep(i,a,n) for(int i=a;i<n;i++) using namespace std; using LL = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int len = sqrt(n); vector<int> a(n + 1), L(n + 1, 0x3f3f3f3f), sum(n + 1); vector<bool> flag(n + 1); auto get = [&](int x) { return x / len; }; for (int i = 1; i <= n; i++) { cin >> a[i]; int x = get(i); L[x] = min(i, L[x]); sum[x] += a[i]; } function<void(int, int)> update = [&](int l, int r) { if (get(l) == get(r)) { for (int i = l; i <= r; i++) { int tmp = a[i] - (int)sqrt(a[i]); a[i] = sqrt(a[i]); sum[get(l)] -= tmp; } } else { int i = l, j = r; while (get(i) == get(l)) { int tmp = a[i] - (int)sqrt(a[i]); a[i] = sqrt(a[i]); sum[get(l)] -= tmp; i++; } while (get(j) == get(r)) { int tmp = a[j] - (int)sqrt(a[j]); a[j] = sqrt(a[j]); sum[get(r)] -= tmp; j--; } for (int k = get(i); k <= get(j); k++) { if (flag[k]) { continue; } int res = 0; int x = L[k]; while (get(x) == k and x <= n) { int tmp = a[x] - (int)sqrt(a[x]); a[x] = sqrt(a[x]); res += tmp; sum[k] -= tmp; x++; } if (res == 0) { flag[k] = true; } } } }; function<int(int, int)> query = [&](int l, int r) { int ans = 0; if (get(l) == get(r)) { for (int i = l; i <= r; i++) { ans += a[i]; } } else { int i = l, j = r; while (get(i) == get(l)) { ans += a[i++]; } while (get(j) == get(r)) { ans += a[j--]; } for (int k = get(i); k <= get(j); k++) { ans += sum[k]; } } return ans; }; for (int i = 0; i < n; i++) { char op; int l, r, c; cin >> op >> l >> r >> c; if (op == '0') { update(l, r); } else { cout << query(l, r) << '\n'; } } return 0; }
单点插入,单点询问
如果连续插入使得一个块内特别大而其它块特别小,则要进行重构,使得所有块大小相对均匀
AC代码:
#include <bits/stdc++.h> #define rep(i,a,n) for(int i=a;i<n;i++) using namespace std; using LL = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int len = sqrt(n), cnt = 0; vector<int> a(n + 1), L(n + 1, 0x3f3f3f3f), sum(n + 1); vector<vector<int>> v(n + 1); auto get = [&](int x) { return x / len; }; for (int i = 1; i <= n; i++) { cin >> a[i]; int x = get(i); v[x].push_back(a[i]); } function<pair<int, int>(int)> query = [&](int r) { int k = 0; while (r > v[k].size()) { r -= v[k].size(); k++; } return make_pair(k, r - 1); }; function<void(int, int)> insert = [&](int l, int r) { pair<int, int> q = query(l); v[q.first].insert(v[q.first].begin() + q.second, r); }; function<void(void)> rebuild = [&]() { vector<int> nxt; for (int i = 0; i <= n; i++) { if (v[i].size()) { for (auto j : v[i]) { nxt.push_back(j); } } else { break; } v[i].clear(); } len = sqrt(nxt.size()); for (int i = 0; i < nxt.size(); i++) { int x = get(i); v[x].push_back(nxt[i]); } }; for (int i = 0; i < n; i++) { char op; int l, r, c; cin >> op >> l >> r >> c; if (op == '0') { cnt++; insert(l, r); if (cnt % len == 0) { rebuild(); } } else { pair<int, int> ans = query(r); cout << v[ans.first][ans.second] << '\n'; } } return 0; }
数列分块入门
于 2022-08-14 22:33:43 首次发布