差分数组:c[i]=a[i]-a[i-1]
然后可以发现 a[i]=a[1]+a[2]-a[1]+a[3]-a[2]+…+a[i]-a[i-1]=c[1]+c[2]+…+c[i]
1,区间修改单点查询
修改a[l]到a[r]值 的时候,只需修改c[l]和c[r+1],然后求一次c[i]的前缀和就可以。
2,区间修改区间查询
还是利用差分的思想。区间求和的公式为:
sum(1,n)
=a[1]+a[2]+a[3]+…+a[n-1]+a[n]
=c[1]+(c[1]+c[2])+…+(c[1]+c[2]+…+c[n])
=n*(c[1]+c[2]+…+c[n])-(0*c[1]+1*c[2]+2*c[3]+…+(n-1)*c[n]).
再利用一个c2数组,使c2[i]=(i-1)*(a[i]-a[i-1])=(i-1)*c[i];
区间修改就有
add(c[l], val), add(c[r+1], -val);
add(c2[l], (l-1)*v),add(c2[r+1], -r*v);
求和时
sum1 = getsum(c, r)*r-getsum(c2,r);
sum2 = getsum(c, l - 1)*(l - 1) - getsum(c2, l - 1);
所以ans=sum1-sum2;
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 1e5 + 5;
LL c[maxn], c2[maxn], a[maxn];
int m, n;
void add(LL r[], int pos, LL val)
{
for (; pos <= n; pos += pos&(-pos))
r[pos] += val;
}
LL getsum(LL r[],int pos)
{
LL ret = 0;
for (; pos; pos -= pos&(-pos))
ret += r[pos];
return ret;
}
int main()
{
while (scanf("%d%d", &n, &m) != EOF) {
for (int i = 1; i <= n; i++) {
scanf("%lld",&a[i]);
add(c, i, a[i] - a[i - 1]);
add(c2, i, (i - 1)*(a[i] - a[i - 1]));
}
for (int i = 1; i <= m; i++) {
int op, l, r;
LL val;
scanf("%d",&op);
if (op == 1) {
scanf("%d%d%lld",&l,&r,&val);
add(c, l, val);
add(c, r + 1, -val);
add(c2, l, (l - 1)*val);
add(c2, r + 1, -r*val);
}
else {
scanf("%d%d",&l,&r);
LL sum1 = getsum(c, r)*r-getsum(c2,r);
LL sum2 = getsum(c, l - 1)*(l - 1) - getsum(c2, l - 1);
printf("%lld\n",sum1-sum2);
}
}
}
return 0;
}