单点修改区间查询
#include<cstdio>
#include<cstring>
using namespace std;
int n,m,a[1000001],c[1000001];
int lowbit(int x) {return x & -x;}
int change(int x,int y)
{
for (;x<=n;)
{
c[x]+=y;
x+=lowbit(x);
}
}
int ques(int x)
{
int ans=0;
while (x>=1)
{
ans+=c[x];
x-=lowbit(x);
}
return ans;
}
int main()
{
scanf("%d %d",&n,&m);
for (int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
change(i,a[i]);
}
for (int i=1; i<=m; i++)
{
int p,x,y; scanf("%d%d%d",&p,&x,&y);
if (p==1) change(x,y);
else printf("%d\n",ques(y)-ques(x-1));
}
return 0;
}
区间修改单点查询
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1000001;
int n,m,a[maxn],tree[maxn<<1];
int lowbit(int x) {return x & -x;}
int getsum(int x)
{
int ans=0;
while (x>0)
{
ans+=tree[x];
x-=lowbit(x);
}
return ans;
}
void change(int x,int t)
{
while (x<=n)
{
tree[x]+=t;
x+=lowbit(x);
}
}
int main()
{
scanf("%d%d",&n,&m);
for (int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
change(i,a[i]-a[i-1]);
}
for (int i=1; i<=m; i++)
{
int opt,x,y,z;
scanf("%d",&opt);
if (opt==2) {scanf("%d",&x); printf("%d\n",getsum(x));}
else
{
scanf("%d%d%d",&x,&y,&z);
change(y+1,-z);
change(x,z);
}
}
return 0;
}