初次接触线段树,网上看了很多人的博客才慢慢了解了,还在学习ing
从最简单的单点更新开始
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAXN 50010
struct node
{
int l,r,mid;
int sum;
}tree[MAXN*4];
int ans;
void build(int l,int r,int id)
{
tree[id].l=l;
tree[id].r=r;
tree[id].mid=(l+r)>>1;
if(l==r)
{
scanf("%d",&tree[id].sum);
return;
}
build(l,tree[id].mid,id<<1);
build(tree[id].mid+1,r,id<<1|1);
tree[id].sum=(tree[id<<1].sum+tree[id<<1|1].sum);
}
void query(int l,int r,int id)
{
if(tree[id].l==l&&tree[id].r==r)
{
ans+=tree[id].sum;
return;
}
if(r<=tree[id].mid) query(l,r,id<<1);
else if(l>tree[id].mid) query(l,r,id<<1|1);
else
{
query(l,tree[id].mid,id<<1);
query(tree[id].mid+1,r,id<<1|1);
}
}
void up(int id,int num,int val)
{
if(tree[id].l==num&&tree[id].r==num)
{
tree[id].sum+=val;
return;
}
if(num<=tree[id].mid) up(id<<1,num,val);
else up(id<<1|1,num,val);
tree[id].sum=(tree[id<<1].sum+tree[id<<1|1].sum);
}
int main()
{
char str[10];
int t,n,m,a,b;
scanf("%d",&t);
for(int cas=1;cas<=t;cas++)
{
scanf("%d",&n);
build(1,n,1);
printf("Case %d:\n",cas);
while(scanf("%s",&str)&&strcmp(str,"End")!=0)
{
scanf("%d%d",&a,&b);getchar();
if(str[0]=='Q')
{
ans=0;
query(a,b,1);
printf("%d\n",ans);
}
else if(str[0]=='A')
{
up(1,a,b);
}
else if(str[0]=='S')
{
up(1,a,-b);
}
else if(str[0]=='E')
{
break;
}
}
}
return 0;
}