//单点修改,区间求值
#include<cstdio>
template<typename tp>inline void read(tp &x)
{
x=0;int f=0;char ch=getchar();
while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
if(f)x=-x;
}
template<typename tp>inline void write(tp x)
{
int buf[40],p=0;
if(x<0)putchar('-'),x=-x;
do{
buf[p++]=x%10;x/=10;
}while(x);
for(int i=p-1;i+1;--i)putchar(buf[i]+48);
putchar('\n');
}
const int N=5e5+10;
int n,m,c[N<<1];
inline void add(int x,int v)
{
for(int i=x;i<=n;i+=i&(-i))c[i]+=v;
}
inline int ask(int x)
{
int ans=0;
for(int i=x;i>0;i-=i&-i)ans+=c[i];
return ans;
}
int main()
{
//freopen("in.txt","r",stdin);
read(n);read(m);
for(int i=1;i<=n;i++)
{
int x;
read(x);
add(i,x);
}
for(int i=1;i<=m;i++)
{
int op,x,y;
read(op);read(x);read(y);
if(op&1)add(x,y);
else write(ask(y)-ask(x-1));
}
return 0;
}
//区间修改,单点求值
#include<cstdio>
template<typename tp>inline void read(tp&x)
{
x=0;int f=0;char ch=getchar();
while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
if(f)x=-x;
}
template<typename tp>inline void write(tp x)
{
int buf[40],p=0;
if(x<0)x=-x,putchar('-');
do{
buf[p++]=x%10,x/=10;
}while(x);
for(int i=p-1;i+1;--i)putchar(buf[i]+48);
putchar('\n');
}
const int N=5e5+10;
int n,m,a[N],c[N<<1];
inline void add(int x,int v)
{
for(int i=x;i<=n;i+=i&(-i))c[i]+=v;
}
inline int ask(int x)
{
int ans=0;
for(int i=x;i>0;i-=i&-i)ans+=c[i];
return ans;
}
int main()
{
//freopen("in.txt","r",stdin);
read(n);read(m);
for(int i=1;i<=n;++i)read(a[i]);
for(int i=1;i<=m;++i)
{
int op,x,y,k;
read(op);
if(op&1)read(x),read(y),read(k),add(x,k),add(y+1,-k);
else read(x),write(ask(x)+a[x]);
}
return 0;
}
【模板】树状数组
最新推荐文章于 2023-04-13 21:15:37 发布