给定空矩阵,
1.将一个矩阵一起加x
2.询问一个矩阵的和
先类似差分,搞一搞,通过sum【i】【j】=sigema{b[i][j]*(n-i+1)*(m-j+1) }推一推
更新时,根据当前树状数组所存内容更新,such as
这种题,一套猛推公式,代入代码,求
bi.add(xx+1,y,-(xx+1)*z);//因为bi存的是b【i】【j】*i,所以这个位置加一个值,这个值要乘上x坐标再加
这个真心不好记,用时现推
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
int n,m;
int lowbit(int x)
{
return x&(-x);
}
struct aa
{
int a[2050][2050];
void add(int x,int y,int k)
{
for (int i=x;i<=n;i+=lowbit(i))
for (int j=y;j<=m;j+=lowbit(j)) a[i][j]+=k;
}
int query(int x,int y)
{
int ans=0;
for (int i=x;i>0;i-=lowbit(i))
for (int j=y;j>0;j-=lowbit(j)) ans+=a[i][j];
return ans;
}
}b,bi,bj,bij;
void updata(int x,int y,int xx,int yy,int z)
{
b.add(x,y,z);b.add(xx+1,y,-z);b.add(x,yy+1,-z);b.add(xx+1,yy+1,z);
bi.add(x,y,z*x);bi.add(xx+1,y,-(xx+1)*z);bi.add(x,yy+1,-z*x);bi.add(xx+1,yy+1,(xx+1)*z);
bj.add(x,y,z*y);bj.add(xx+1,y,-z*y);bj.add(x,yy+1,-(yy+1)*z);bj.add(xx+1,yy+1,(yy+1)*z);
bij.add(x,y,x*y*z);bij.add(xx+1,y,-(xx+1)*y*z);bij.add(x,yy+1,-(yy+1)*x*z);
bij.add(xx+1,yy+1,(xx+1)*(yy+1)*z);
}
int sum(int x,int y)//求出1,1~x,y的总和
{
return b.query(x,y)*(x+1)*(y+1)-bi.query(x,y)*(y+1)-bj.query(x,y)*(x+1)+bij.query(x,y);
}
int main()
{
char ch[10];
scanf("%s%d%d",ch,&n,&m);
int x,y,xx,yy,z;
while (scanf("%s",ch)!=EOF)
{
if (ch[0]=='L')
{
scanf("%d%d%d%d%d",&x,&y,&xx,&yy,&z);
updata(x,y,xx,yy,z);
}
else
{
scanf("%d%d%d%d",&x,&y,&xx,&yy);
printf("%d\n",sum(xx,yy)-sum(x-1,yy)-sum(xx,y-1)+sum(x-1,y-1));
}
}
return 0;
}