刚开始学习线段树,这道题是道不错的模板题。
关于线段树可参考:
https://blog.csdn.net/x314542916/article/details/7837276
https://blog.csdn.net/WhereIsHeroFrom/article/details/78969718
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn=5e4+5;
struct Node
{
int l,r;
int sum;
}tr[maxn<<2];
int a[maxn];
char s1[]="Query",s2[]="Add",s3[]="Sub",s4[]="End";
void push_up(int rt)
{
tr[rt].sum=tr[rt<<1].sum+tr[rt<<1|1].sum;
}
void build(int rt,int l,int r)
{
tr[rt].l=l; tr[rt].r=r;
if(l==r)
{
tr[rt].sum=a[l];
return;
}
else
{
int mid=(l+r)>>1;
build(rt<<1,l,mid);
build(rt<<1|1,mid+1,r);
push_up(rt);
}
}
void update(int rt,int ql,int qr,int val)
{
if(ql==tr[rt].l&&tr[rt].r==qr)
{
tr[rt].sum+=val;
return;
}
int mid=(tr[rt].l+tr[rt].r)>>1;
if(mid<ql) update(rt<<1|1,ql,qr,val);
else if(mid>=qr) update(rt<<1,ql,qr,val);
else
{
update(rt<<1,ql,mid,val);
update(rt<<1|1,mid+1,qr,val);
}
push_up(rt); //push_up位置别放错
}
void query(int rt,int ql,int qr,int &sum)
{
if(ql<=tr[rt].l&&tr[rt].r<=qr)
{
sum+=tr[rt].sum;
return;
}
if(tr[rt].l==tr[rt].r) return;
int mid=(tr[rt].l+tr[rt].r)>>1;
if(mid<ql) query(rt<<1|1,ql,qr,sum);
else if(mid>=qr) query(rt<<1,ql,qr,sum);
else
{
query(rt<<1,ql,mid,sum);
query(rt<<1|1,mid+1,qr,sum);
}
}
int main()
{
int T,kase=0;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;++i) scanf("%d",&a[i]);
build(1,1,n);
printf("Case %d:\n",++kase);
char s[10];
while(~scanf("%s",s))
{
if(strcmp(s,s4)==0) break;
int a,b;
scanf("%d%d",&a,&b);
if(strcmp(s,s1)==0)
{
int sum=0;
query(1,a,b,sum);
printf("%d\n",sum);
}
else if(strcmp(s,s2)==0)
update(1,a,a,b);
else if(strcmp(s,s3)==0)
update(1,a,a,-b);
}
}
return 0;
}