区间修改用差分数组
区间查询 修改公式
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lowbit(x) x&(-x)
const int N=2e5;
ll c1[N],c2[N],n,m,a[N];
ll add(ll x,ll y)
{
for(ll i=x;i<=n;i+=lowbit(i))
{
c1[i]+=y;
c2[i]+=x*y;
}
}
ll ask(ll x)
{
ll ans=0;
for(ll i=x;i;i-=lowbit(i))
ans+=(x+1)*c1[i]-c2[i];
return ans;
}
int main()
{
scanf("%lld%lld\n",&n,&m);
for(ll i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
add(i,a[i]-a[i-1]); // 差分进去
}
getchar();
while(m--)
{
char ch=getchar();
if (ch=='Q')
{
ll x,y;
scanf("%lld%lld\n",&x,&y);
cout<<ask(y)-ask(x-1)<<endl;
}
if (ch=='C')
{
ll x,y,d;
cin>>x>>y>>d;
scanf("%lld%lld%lld\n",&x,&y,&d);
add(x,d);
add(y+1,-d);
}
}
return 0;
}