//HDOJ 1166 敌兵布阵 线段树: 单点更新 成段求和
/*
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1166
题意: N个工兵营地(N<=50000),已知每个工兵营地的初始人数,
M次(M<=40000)操作 : 1、在第i个营地增加j个人;
2、在第i个营地减少j个人;
3、询问营地i到营地j的总人数 ;
*/
#include<iostream>
using namespace std;
#define N 150005
struct node{
int left;
int right;
int num;
};
node t[N];
int a[N];
int build(int r,int left,int right){
t[r].left = left;
t[r].right = right;
if(left == right)
return t[r].num = a[left];
int m = (left + right) / 2;
return t[r].num = build(r*2,left,m) + build(r*2+1,m+1,right);
}
int query(int r, int left, int right){
int m = (t[r].left + t[r].right)/2;
if((t[r].left == left) && (t[r].right == right))
return t[r].num;
if(right <= m)
return query(r*2,left,right);
if(left > m)
return query(r*2+1,left,right);
return query(r*2,left,m)+query(r*2+1,m+1,right);
}
void update(int r,int x,int y){
t[r].num += y;
if(t[r].left == t[r].right)
return ;
int m = (t[r].left + t[r].right)/2;
if(x <= m)
update(r*2,x,y);
else
update(r*2+1,x,y);
}
int main(){
int i,j,T,n;
int x,y;
char s[5];
scanf("%d",&T);
for(i = 1; i <= T; ++i){
scanf("%d",&n);
for(j = 1; j <= n; ++j)
scanf("%d",&a[j]);
build(1,1,n);
printf("Case %d:\n",i);
do{
scanf("%s",s);
if(s[0] == 'A'){
scanf("%d %d",&x,&y);
update(1,x,y);
}
else if(s[0] == 'S'){
scanf("%d %d",&x,&y);
update(1,x,-y);
}
else if(s[0] == 'Q'){
scanf("%d %d",&x,&y);
printf("%d\n",query(1,x,y));
}
}while(s[0] != 'E');
}
return 0;
}
HDOJ 1166 敌兵布阵 线段树: 单点更新 成段求和
最新推荐文章于 2018-10-11 11:30:00 发布