【YbtOJ 线段树 - 2】区间查改

区间查改

---

题目

---

输入

输出

---

输入样例

5 10
2 6 6 1 1
2 1 4
1 2 5 10
2 1 3
2 2 3
1 2 2 8
1 2 3 7
1 4 4 10
2 1 2
1 4 5 6
2 3 4

输出样例

15
34
32
33
50

---

解题思路

就是线段树直接上即可

---

程序如下

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>

using namespace std;

int n, q, l, r, x, k;

long long a[4000001], add[4000001];

long long sum[4000001];

void build(int k, int l, int r)
{
	if(l == r) 
	{
		sum[k] = a[l];
		return;
	}
	int mid = (l + r) / 2;
	build(k * 2, l, mid);
	build(k * 2 + 1, mid + 1, r);
	sum[k] = sum[k * 2] + sum[k * 2 + 1];
}

void Add(int k, int l, int r, int v)
{
	add[k] += v;
	sum[k] += (long long)v * (long long)(r - l + 1);
}

void pushdown(int k, int l, int r, int mid)
{
	if(!add[k]) return;
	Add(k * 2, l, mid, add[k]);
	Add(k * 2 + 1, mid + 1, r, add[k]);
	add[k] = 0;
}

long long query(int k, int l, int r, int x, int y)
{
	if(x <= l && r <= y) return sum[k];
	int mid = (l + r) / 2;
	long long res = 0;
	pushdown(k, l, r, mid);
	if(x <= mid) res += query(k * 2, l, mid, x, y);
	if(y > mid) res += query(k * 2 + 1, mid + 1, r, x, y);
	return res;
}

void change(int k, int l, int r, int x, int y, int v)
{
	if(x <= l && r <= y)
	{
		Add(k, l, r, v);
		return;
	}
	int mid = (l + r) / 2;
	pushdown(k, l, r, mid);
	if(x <= mid) change(k * 2, l, mid, x, y, v);
	if(y > mid) change(k * 2 + 1, mid + 1, r, x, y, v);
	sum[k] = sum[k * 2] + sum[k * 2 + 1];
} 

int main()
{
	scanf("%d%d",&n,&q);
	for(int i = 1; i <= n; ++i)
		scanf("%lld",&a[i]);
	build(1, 1, n);
	for(int i = 1; i <= q; ++i)
	{
		scanf("%d",&k);
		if(k == 1)
		{
			scanf("%d%d%d",&l,&r,&x);
			change(1, 1, n, l, r, x);
		}
		else if(k == 2)
		{
			scanf("%d%d",&l,&r); 
			printf("%lld\n",query(1, 1, n, l, r)); 
		}
	}
	return 0;
}