Finish range queries + refactor

Author: oscarburga

range-queries/2-salary-queries.cpp

@@ -0,0 +1,66 @@
+#include <bits/stdc++.h>
+#define debug(...) fprintf(stderr, __VA_ARGS__)
+using namespace std;
+using ll = long long;
+
+const int maxn = 2e5+5, inf = 1e9+7;
+int n, q, a[maxn], lazy[maxn<<2];
+ll st[maxn<<2], pre[maxn], ans[maxn];
+
+void push(int pos, int l, int r) { 
+	if (!lazy[pos]) return;
+	st[pos] = 1ll * lazy[pos] * (r-l+1);
+	if (l < r) lazy[pos<<1] = lazy[pos<<1|1] = lazy[pos];
+	lazy[pos] = 0;
+}
+
+void upd(int ql, int qr, int v, int pos = 1, int l = 1, int r = n) { 
+	push(pos, l, r);
+	if (r < ql or l > qr) return;
+	if (ql <= l && r <= qr) { 
+		lazy[pos] = v;
+		push(pos, l, r);
+		return;
+	}
+	int mid = (l+r) >> 1, child = pos<<1;
+	upd(ql, qr, v, child, l, mid);
+	upd(ql, qr, v, child|1, mid+1, r);
+	st[pos] = st[child] + st[child|1];
+}
+
+ll query(int ql, int qr, int pos = 1, int l = 1, int r = n) { 
+	push(pos, l, r);
+	if (r < ql or l > qr) return 0;
+	if (ql <= l && r <= qr) return st[pos];
+	int mid = (l+r) >> 1, child = pos<<1;
+	return query(ql, qr, child, l, mid) + query(ql, qr, child|1, mid+1, r);
+}
+
+vector<pair<int,pair<int,int>>> stk;
+vector<pair<int,int>> qs[maxn];
+
+int main(){
+	scanf("%d %d", &n, &q);
+	for(int i = 1; i<=n; i++) {
+		scanf("%d", &a[i]), 
+		pre[i] = pre[i-1] + a[i];
+	}
+	for(int i = 0, l, r; i<q; i++) {
+		scanf("%d %d", &l, &r);
+		qs[l].emplace_back(r, i);
+	}
+	stk.emplace_back(inf, make_pair(n+1, n+1));
+	for(int i = n, r; i > 0; --i) {
+		r = i;
+		while (stk.back().first < a[i]) {
+			r = stk.back().second.second;
+			stk.pop_back();
+		}
+		stk.emplace_back(a[i], make_pair(i, r));
+		upd(i, r, a[i]);
+		for(auto &p: qs[i]) ans[p.second] = query(i, p.first) - pre[p.first] + pre[i-1];
+	}
+	for(int i = 0; i<q; i++) printf("%lld\n", ans[i]);
+	return 0;
+}
+

range-queries/2rmq.cpp …ueries/dynamic-range-minimum-queries.cpprange-queries/2rmq.cpp renamed to range-queries/dynamic-range-minimum-queries.cpp range-queries/2rmq.cpp renamed to range-queries/dynamic-range-minimum-queries.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+#define debug(...) fprintf(stderr, __VA_ARGS__)
+using namespace std;
+using ll = long long;
+
+const int maxn = 2e5+5, inf = 2e9;
+int n, q, a[maxn], st[2][4*maxn];
+
+void build(int id, int pos = 1, int l = 1, int r = n) {
+	if (l == r) { 
+		st[id][pos] = a[l] + (id == 0 ? -l : l);
+		return;
+	}
+	int mid = (l+r) >> 1;
+	build(id, pos<<1, l, mid);
+	build(id, pos<<1|1, mid+1, r);
+	st[id][pos] = min(st[id][pos<<1], st[id][pos<<1|1]);
+}
+
+void upd(int id, int i, int v, int pos = 1, int l = 1, int r = n) {
+	if (l == r) { st[id][pos] = v; return; }
+	int mid = (l+r) >> 1, child = pos << 1;
+	if (i <= mid) upd(id, i, v, child, l, mid);
+	else upd(id, i, v, child|1, mid+1, r);
+	st[id][pos] = min(st[id][child], st[id][child|1]);
+}
+
+int query(int id, int ql, int qr, int pos = 1, int l = 1, int r = n) {
+	if (r < l or r < ql or l > qr) return inf;
+	if (ql <= l && r <= qr) return st[id][pos];
+	int mid = (l+r) >> 1, child = pos << 1;
+	return min(query(id, ql, qr, child, l ,mid), query(id, ql, qr, child|1, mid+1, r));
+}
+
+int main(){
+	scanf("%d %d", &n, &q);
+	for(int i = 1; i<=n; i++) scanf("%d", &a[i]);
+	build(0);
+	build(1);
+	for(int t, k; q--; ) {
+		scanf("%d %d", &t, &k);
+		if (t == 1) scanf("%d", &a[k]), upd(0, k, a[k]-k), upd(1, k, a[k]+k);
+		else printf("%d\n", min(query(0, 1, k) + k, query(1, k, n) - k));
+	}
+
+	return 0;
+}
+

range-queries/2rsq.cpp …ge-queries/dynamic-range-sum-queries.cpprange-queries/2rsq.cpp renamed to range-queries/dynamic-range-sum-queries.cpp range-queries/2rsq.cpp renamed to range-queries/dynamic-range-sum-queries.cpp

@@ -0,0 +1,75 @@
+#include <bits/stdc++.h>
+#define debug(...) fprintf(stderr, __VA_ARGS__)
+using namespace std;
+using ll = long long;
+
+const int maxn = 2e5+5;
+
+int n, q, a[maxn];
+
+struct node {
+	ll sum;
+	ll l_a, l_k;
+	explicit node(ll v = 0) : sum(v), l_a(0), l_k(0) {}
+	void pull(const node &par, int l, int parl) { 
+		l_a += par.l_a + par.l_k * (l-parl);
+		l_k += par.l_k;
+	}
+} st[4*maxn];
+
+void build(int pos = 1, int l = 1, int r = n) { 
+	if (l == r) { st[pos].sum = a[l]; return; }
+	int mid = (l+r) >> 1, child = pos << 1;
+	build(child, l, mid);
+	build(child|1, mid+1, r);
+	st[pos].sum = st[child].sum + st[child|1].sum;
+}
+
+void push(int pos, int l, int r) { 
+	node &cur = st[pos];
+	if (cur.l_a == 0 && cur.l_k == 0) return;
+	cur.sum += cur.l_a * (r-l+1);
+	cur.sum += cur.l_k * ((1ll * (r-l) * (r-l+1)) >> 1);
+	if (l < r) {
+		int child = pos << 1, mid = (l+r) >> 1;
+		st[child].pull(cur, l, l);
+		st[child|1].pull(cur, mid+1, l);
+	}
+	cur.l_a = cur.l_k = 0;
+}
+
+void upd(int ql, int qr, int pos = 1, int l = 1, int r = n) {
+	push(pos, l, r);
+	if (r < ql or l > qr) return;
+	if (ql <= l && r <= qr) {
+		st[pos].l_a += l-ql+1;
+		st[pos].l_k += 1;
+		push(pos, l, r);
+		return;
+	}
+	int mid = (l+r) >> 1, child = pos << 1;
+	upd(ql, qr, child, l, mid);
+	upd(ql, qr, child|1, mid+1, r);
+	st[pos].sum = st[child].sum + st[child|1].sum;
+}
+
+ll query(int ql, int qr, int pos = 1, int l = 1, int r = n) {
+	push(pos, l, r);
+	if (r < ql or l > qr) return 0;
+	if (ql <= l && r <= qr) return st[pos].sum;
+	int mid = (l+r) >> 1, child = pos << 1;
+	return query(ql, qr, child, l, mid) + query(ql, qr, child|1, mid+1, r);
+}
+
+int main(){
+	scanf("%d %d", &n, &q);
+	for(int i = 1; i<=n; i++) scanf("%d", &a[i]);
+	build();
+	for(int t, l, r; q--; ) {
+		scanf("%d %d %d", &t, &l, &r);
+		if (t == 1) upd(l, r);
+		else printf("%lld\n", query(l, r));
+	}
+	return 0;
+}
+

range-queries/2forest-queries.cpp range-queries/forest-queries-ii.cpprange-queries/2forest-queries.cpp renamed to range-queries/forest-queries-ii.cpp

@@ -0,0 +1,66 @@
+#include <bits/stdc++.h>
+#define debug(...) fprintf(stderr, __VA_ARGS__)
+using namespace std;
+using ll = long long;
+
+const int maxn = 2e5+5;
+const ll inf = 1e18;
+int n, q, a[maxn];
+ll pre[maxn], st[maxn*4], lazy[maxn*4];
+
+void build(int pos = 1, int l = 1, int r = n) {
+	if (l == r) { st[pos] = pre[l]; return; }
+	int mid = (l+r) >> 1, child = pos<<1;
+	build(child, l, mid);
+	build(child|1, mid+1, r); 
+	st[pos] = max(st[child], st[child|1]);
+}
+
+void push(int pos, int l, int r) { 
+	if (lazy[pos] == 0) return;
+	st[pos] += lazy[pos];
+	if (l < r) lazy[pos<<1] += lazy[pos], lazy[(pos<<1)|1] += lazy[pos];
+	lazy[pos] = 0;
+}
+
+void updr(int ql, int qr, ll v, int pos = 1, int l = 1, int r = n) { 
+	push(pos, l, r);
+	if (r < ql or l > qr) return;
+	if (ql <= l && r <= qr) {
+		lazy[pos] += v;
+		push(pos, l, r);
+		return;
+	}
+	int mid = (l+r) >> 1, child = pos << 1;
+	updr(ql, qr, v, child, l, mid);
+	updr(ql, qr, v, child|1, mid+1, r);
+	st[pos] = max(st[child], st[child|1]);
+}
+
+ll qmax(int ql, int qr, int pos = 1, int l = 1, int r = n) {
+	push(pos, l, r);
+	if (qr < 1) return 0ll;
+	if (r < ql or l > qr) return -inf;
+	if (ql <= l && r <= qr) return st[pos];
+	int mid = (l+r) >> 1, child = pos<<1;
+	return max(qmax(ql, qr, child, l, mid), qmax(ql, qr, child|1, mid+1, r));
+}
+
+int main(){
+	scanf("%d %d", &n, &q);
+	for(int i = 1; i<=n; i++) {
+		scanf("%d", &a[i]);
+		pre[i] = pre[i-1] + a[i];
+	}
+	build();
+	for(int t, k, u; q--; ) {
+		scanf("%d %d %d", &t, &k, &u);
+		if (t == 1) {
+			updr(k, n, ll(u) - a[k]);
+			a[k] = u;
+		} else printf("%lld\n", max(qmax(k, u) - qmax(k-1, k-1), 0ll));
+	}
+
+	return 0;
+}
+