区间修改区间查询【树状数组】

>Link

ybtoj区间修改区间查询

---

>解题思路

很经典的线段树模板，其实也可以用树状数组做

考虑差分，$t_i=a_i-a_{i-1}$，那显然 $a_i={\sum }_{j=1}^i{t}_j$
把查询的区间 $[l,r]$ 转换成查询 $[1,l]$ 和 $[1,r]$
$su{m}_l=a_1+a_2+...+a_l=(t_1)+(t_1+t_2)+...+(t_1+t_2+...+t_l)=(t_1+t_2+...+t_l)\ast l-(t_1\ast 0+t_2\ast 1+...+t_l\ast (l-1))$
我们就可以维护两个树状数组，一个正常的存 $t_i$，另一个存 $t_i\ast (i-1)$
（这样的思想就是，把与 $l$ 有关的系数转换一下变成与自身有关的系数）

---

>代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define LL long long
#define N 1000010
using namespace std;

int n, q;
LL a[N], t[N], tt[N], ans;

void add_t (int x, LL val)
{
	for (; x <= n; x += x & (-x))
	  t[x] += val; 
}
void add_tt (int x, LL val)
{
	for (; x <= n; x += x & (-x))
	  tt[x] += val; 
}
LL ask_t (int x)
{
	LL ret = 0;
	for (; x; x -= x & (-x)) ret += t[x];
	return ret;
}
LL ask_tt (int x)
{
	LL ret = 0;
	for (; x; x -= x & (-x)) ret += tt[x];
	return ret;
}
LL sum (int x)
{
	LL ret = ask_t (x) * (LL)x;
	ret -= ask_tt (x);
	return ret;
}

int main()
{
	int type, l, r; LL x;
	scanf ("%d%d", &n, &q);
	for (int i = 1; i <= n; i++)
	{
		scanf ("%lld", &a[i]);
		add_t (i, a[i] - a[i - 1]);
		add_tt (i, ((LL)i - (LL)1) * (a[i] - a[i - 1]));
	}
	for (int i = 1; i <= q; i++)
	{
		scanf ("%d", &type);
		if (type == 1)
		{
			scanf ("%d%d%lld", &l, &r, &x);
			add_t (l, x), add_t (r + 1, -x);
			add_tt (l, ((LL)l - (LL)1) * x);
			add_tt (r + 1, -x * (LL)r);
		}
		else
		{
			scanf ("%d%d", &l, &r);
			printf ("%lld\n", sum (r) - sum (l - 1));
		}
	}
	return 0;
}