不如树状数组

#include<bits/stdc++.h>
#define int long long
#define IL inline
#define RI register int
#define lowbit(x) x&-x 
IL void in(int &x){
    int f=1;x=0;char s=getchar();
    while(s>'9'||s<'0'){if(s=='-')f=-1;s=getchar();}
    while(s<='9'&&s>='0'){x=x*10+s-'0';s=getchar();}
    x*=f;
}
int n,m,last,opt,x,y,z,mian;
int sum1[500002],sum2[500002];
IL void add(int pos,int x)
{
	for(RI i=pos;i<=n;i+=lowbit(i))
		sum1[i]+=x,sum2[i]+=pos*x;
}
IL long long query(int pos)
{
	long long res=0;
	for(RI i=pos;i;i-=lowbit(i))
		res+=(pos+1)*sum1[i]-sum2[i];
	return res;
} 
main(void)
{
	in(n),in(m);
	for(RI i=1;i<=n;i++)in(x),add(i,x-last),last=x;
	for(RI i=1,opt;i<=m;i++)
	{
		in(opt);
		switch(opt)
		{
			case 1:in(x),in(y),in(z),add(x,z),add(y+1,-z);break;
			case 2:in(z),mian+=z;break;
			case 3:in(z),mian-=z;break;
			case 4:in(x),in(y);printf("%lld\n",query(y)-query(x-1)+(x==1)*mian);break;
			case 5:printf("%lld\n",query(1)+mian);
		}
	}
}