洛谷3372——分块（add标记）

洛谷3372——分块（add标记）

原题传送门
题目是线段树，属于区间更新的内容，但是分块也能过。
已ac代码：

# include <iostream>
# include <algorithm>
# include <cstdio>
# include <cmath>
using namespace std;

const int maxn = 1e5 + 10;
typedef long long ll;

int a[maxn], l[maxn], r[maxn], pos[maxn];
ll sum[maxn] = { 0 }, add[maxn] = { 0 };
ll block, num, ans;

void bulid(int n) {
	block = (int)sqrt(n);
	num = n / block;
	if (n%block) {
		num++;
	}
	for (int i = 1; i <= n; i++) {
		pos[i] = (i-1) / block+1;
		sum[pos[i]] += a[i];
	}
	for (int i = 1; i <= num; i++) {
		l[i] = (i - 1)*block + 1;
		r[i] = i * block;
		
	}
	r[num] = n;
	return;
}

void update(int ll,int rr,int val) {
	if (pos[ll] == pos[rr]) {
		for (int i = ll; i <= rr; i++) {
			a[i] += val;
		}
		sum[pos[ll]] += (rr - ll + 1)*val;
		return;
	}
	for (int i = ll; i <= r[pos[ll]]; i++) {
		a[i] += val;
	}
	sum[pos[ll]] += (r[pos[ll]] - ll + 1)*val;
	for (int i = pos[ll] + 1; i < pos[rr]; i++) {
		add[i] += val;
		sum[i] += block * val;
	}
	for (int i = l[pos[rr]]; i <= rr; i++) {
		a[i] += val;
	}
	sum[pos[rr]] += (rr - l[pos[rr]] + 1)*val;
	return;
}

void fin(int ll,int rr) {
	if (pos[ll] == pos[rr]) {
		for (int i = ll; i <= rr; i++) {
			ans += a[i]+add[pos[ll]];
		}
		return;
	}
	for (int i = ll; i <= r[pos[ll]]; i++) {
		ans += a[i]+ add[pos[ll]];
	}
	for (int i = pos[ll] + 1; i < pos[rr]; i++) {
		ans += sum[i];
	}
	for (int i = l[pos[rr]]; i <= rr; i++) {
		ans += a[i]+ add[pos[rr]];
	}
	return;
}

int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	bulid(n);
	int t;
	int left, right, val;
	for (int i = 0; i < m; i++) {
		cin >> t;
		if (t == 1) {
			cin >> left >> right >> val;;
			update(left, right, val);
		}
		else if (t == 2) {
			cin >> left >> right;
			ans = 0;
			fin(left, right);
			cout << ans << endl;
		}
	}
	return 0;
}