题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1166
#include <iostream>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
#define INF 0xfffffff
#define MAX(a,b) a>b?a:b
#define MIN(a,b) a>b?b:a
#define N 50005
int c[N];
int lowbit(int t)
{
return t&(-t);
}
void insert(int k,int d,int max)
{
while(k<=max)
{
c[k]+=d;
k+=lowbit(k);
}
}
int getsum(int k)
{
int t=0;
while(k>0) //必须k>0,不能k为真。
{
t+=c[k];
k-=lowbit(k);
}
return t;
}
char s[100];
int main()
{
int i,j,k,t;
int m,n,num;
cin>>t;
int st,ed,position;
for(i=1;i<=t;i++)
{
memset(c,0,sizeof(c));
cin>>n;
for(j=1;j<=n;j++)
{
cin>>num;
insert(j,num,n);
}
printf("Case %d:\n",i);
while(cin>>s){
if(s[0]=='E') break;
if(s[0]=='Q') {
cin>>st>>ed;
printf("%d\n",getsum(ed)-getsum(st-1));
}
else if(s[0]=='S') {
cin>>position>>num;
insert(position,-1*num,n);
}
else {
cin>>position>>num;
insert(position,num,n);
}
}
}
return 0;
}