http://acm.hdu.edu.cn/showproblem.php?pid=1166
题目大意:T组测试,每组测试有N个工兵营,给出每个工兵营初始士兵人数。接下来有各种操作:
Add i j i和j为正整数,表示第i个营地增加j个人(j不超过30)
Sub i j i和j为正整数,表示第i个营地减少j个人(j不超过30);
Query i j i和j为正整数,i<=j,表示询问第i到第j个营地的总人数;
End 表示结束,这条命令在每组数据最后出现;
每组数据最多有40000条命令。
思路:建立线段树,每个点记录该区域中的士兵总数。
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define SIZE 50004
using namespace std;
struct node
{
int sum,left,right;
}a[SIZE<<2];
int num[SIZE];
int Build(int left,int right,int root)
{
int m;
a[root].left=left;
a[root].right=right;
if(left==right){
a[root].sum=num[right];
return a[root].sum;
}
m=(right+left)>>1;
a[root].sum=Build(left,m,root<<1);
a[root].sum+=Build(m+1,right,root<<1|1);
return a[root].sum;
}
void Add(int root,int x,int y)
{
int m;
a[root].sum+=y;
if(a[root].left==a[root].right && a[root].left==x){
return;
}
m=(a[root].right+a[root].left)>>1;
if(x<=m){
Add(root<<1,x,y);
}
else{
Add(root<<1|1,x,y);
}
return;
}
int Query(int root,int left,int right)
{
int sum=0;
if(left<=a[root].left && right>=a[root].right){
return a[root].sum;
}
if(a[root<<1].right>=right){
sum+=Query(root<<1,left,right);
}
else if(a[root<<1|1].left<=left){
sum+=Query(root<<1|1,left,right);
}
else{
sum+=Query(root<<1,left,a[root<<1].right);
sum+=Query(root<<1|1,a[root<<1|1].left,right);
}
return sum;
}
int main()
{
int T,nCase=1,n,x,y,i,sum;
char ope[10];
scanf("%d",&T);
while(T--){
memset(a,0,sizeof(a));
memset(num,0,sizeof(num));
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&num[i]);
}
Build(1,n,1);
printf("Case %d:\n",nCase++);
while(scanf("%s",ope),strcmp(ope,"End")!=0){
scanf("%d%d",&x,&y);
if(strcmp(ope,"Add")==0){
Add(1,x,y);
}
else if(strcmp(ope,"Sub")==0){
Add(1,x,-y);
}
else{
sum=Query(1,x,y);
printf("%d\n",sum);
}
}
}
return 0;
}