#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m;
ll a[5010][5010];
ll lowbit(ll x){
return (x&-x);
}
void add(ll x,ll y,ll k){
for(ll i=x;i<=n;i+=lowbit(i)){
for(ll j=y;j<=m;j+=lowbit(j)){
a[i][j]+=k;
}
}
}
ll getsum(ll x,ll y){
ll sum=0;
for(ll i=x;i>0;i-=lowbit(i)){
for(ll j=y;j>0;j-=lowbit(j)){
sum+=a[i][j];
}
}
return sum;
}
int main(){
scanf("%lld%lld",&n,&m);
ll type;
while(scanf("%lld",&type)!=EOF){
if(type==1){
ll x,y,k;
scanf("%lld%lld%lld",&x,&y,&k);
add(x,y,k);
}
if(type==2){
ll x1,y1,x2,y2;
scanf("%lld%lld%lld%lld",&x1,&y1,&x2,&y2);
printf("%lld\n",getsum(x2,y2)-getsum(x2,y1-1)-getsum(x1-1,y2)+getsum(x1-1,y1-1));
}
}
return 0;}
原文链接: https://www.cnblogs.com/sweetlittlebaby/p/12643358.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍;
也有高质量的技术群,里面有嵌入式、搜广推等BAT大佬
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/340375
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!