分块初学2

题目：区间修改，区间查询

做法：和普通的分块做法类似，mrak[i]表示第i这个块每个元素加上的值，d[i]表示第i这个块所有元素之和。

代码如下：

#include<iostream>#include<cstring>#include<string>#include<algorithm>#include<cmath>#include<cstdio>using namespace std;int block,n,m,op,x,y,z;long long  a[100005],l[100005],r[100005],belong[100005],mark[100005],d[100005];void change(int x,int y,int z){if (belong[x]==belong[y]){for (int i=l[belong[x]];i<=r[belong[x]];i++) a[i]=a[i]+mark[belong[x]];d[belong[x]]=d[belong[x]]+mark[belong[x]]*(r[belong[x]]-l[belong[x]]+1);mark[belong[x]]=0;for (int i=x;i<=y;i++) a[i]=a[i]+z;d[belong[x]]=d[belong[x]]+z*(y-x+1);return;}for (int i=x;i<=r[belong[x]];i++) a[i]=a[i]+z;d[belong[x]]=d[belong[x]]+(r[belong[x]]-x+1)*z;for (int i=l[belong[y]];i<=y;i++) a[i]=a[i]+z;d[belong[y]]=d[belong[y]]+(y-l[belong[y]]+1)*z;for (int i=belong[x]+1;i<belong[y];i++){mark[i]=mark[i]+z;d[i]=d[i]+block*z;}}long long sum(int x,int y){long long ans=0;if (belong[x]==belong[y]){for (int i=x;i<=y;i++) ans=ans+a[i];ans=ans+mark[belong[x]]*(y-x+1);return ans;}for (int i=x;i<=r[belong[x]];i++) ans=ans+a[i];ans=ans+mark[belong[x]]*(r[belong[x]]-x+1);for (int i=l[belong[y]];i<=y;i++) ans=ans+a[i];ans=ans+mark[belong[y]]*(y-l[belong[y]]+1);for (int i=belong[x]+1;i<belong[y];i++) ans=ans+d[i];return ans;}int main(){scanf("%d%d",&n,&m);for (int i=1;i<=n;i++) scanf("%lld",&a[i]);block=(int)sqrt(n);int num=n/block;if (n%block!=0) num++;for (int i=1;i<=n;i++) belong[i]=((i-1)/block)+1;for (int i=1;i<=num;i++){l[i]=(i-1)*block+1;r[i]=i*block;}memset(mark,0,sizeof(mark));for (int i=1;i<=n;i++) d[belong[i]]=d[belong[i]]+a[i];for (int i=1;i<=m;i++){scanf("%d",&op);if (op==2){scanf("%d%d",&x,&y);printf("%lld\n",sum(x,y));}if (op==1){scanf("%d%d%d",&x,&y,&z);change(x,y,z);}}return 0;}