1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

#include<stdio.h>
#include<string.h>
int a[50200];
int n;
void add(int k,int m) {
	while(k<=n) {
		a[k]+=m;
		k+=k&-k;
	}
}
int res(int k) {
	int sum=0;
	while(k) {
		sum+=a[k];
		k-=k&-k;
	}
	return sum;
}
int main() {
	int T,kase=0;
	scanf("%d",&T);
	while(T--) {
		memset(a,0,sizeof(a));
		printf("Case %d:\n",++kase);
		scanf("%d",&n);
		for(int i=1; i<=n; i++) {
			int t;
			scanf("%d",&t);
			add(i,t);
		}
		char s[10];
		while(scanf("%s",s),s[0]!='E') {
			int x,y;
			scanf("%d %d",&x,&y);
			if(s[0]=='Q')
				printf("%d\n",res(y)-res(x-1));
			else if(s[0]=='A')
				add(x,y);
			else if(s[0]=='S')
				add(x,-y);
		}
	}
	return 0;
}