P1438 无聊的数列(线段树维护差分)

P1438 无聊的数列https://www.luogu.com.cn/problem/P1438

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

struct tree {
	int l, r;
	ll sum;
	ll lz;
} tr[MAXN];
ll s[MAXN];

inline void push_down(int q) {
	if (!tr[q].lz || tr[q].r == 0)
		return;
	tr[q << 1].sum += tr[q].lz * (tr[q << 1].r - tr[q << 1].l + 1);
	tr[q << 1 | 1].sum += tr[q].lz * (tr[q << 1 | 1].r - tr[q << 1 | 1].l + 1);
	tr[q << 1].lz += tr[q].lz;
	tr[q << 1 | 1].lz += tr[q].lz;
	tr[q].lz = 0;
}

void build(int q, int l, int r) {
	tr[q] = {l, r, 0, 0};
	if (l == r)
		return;
	int mid = l + r >> 1;
	build(q << 1, l, mid);
	build(q << 1 | 1, mid + 1, r);
}

void update(ll d, int q, int l, int r) {
	if (tr[q].l >= l && tr[q].r <= r) {
		tr[q].sum += d * (tr[q].r - tr[q].l + 1);
		tr[q].lz += d;
		return;
	}
	push_down(q);
	int mid = tr[q].l + tr[q].r >> 1;
	if (mid >= l)
		update(d, q << 1, l, r);
	if (mid < r)
		update(d, q << 1 | 1, l, r);
	tr[q].sum = tr[q << 1].sum + tr[q << 1 | 1].sum;
}

ll query(int q, int l, int r) {
	if (tr[q].l >= l && tr[q].r <= r)
		return tr[q].sum;
	push_down(q);
	ll ans = 0;
	int mid = tr[q].l + tr[q].r >> 1;
	if (mid >= l)
		ans = query(q << 1, l, r);
	if (mid < r)
		ans += query(q << 1 | 1, l, r);
	return ans;
}

int main() {
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", s + i);
	}
	build(1, 1, n);
	int t, l, r;
	ll K, D;
	for (int i = 1; i <= m; i++) {
		scanf("%d", &t);
		if (t == 1) {
			scanf("%d %d %lld %lld", &l, &r, &K, &D);
			update(K, 1, l, l);
			if(l<r) update(D, 1, l + 1, r);
			if(r<n) update(-(K + (r - l)*D), 1, r + 1, r + 1);
		} else {
			scanf("%d", &l);
			printf("%lld\n", s[l] + query(1, 1, l));
		}
	}
	return 0;
}