敌兵布阵 HDU 1166

参考博客https://www.cnblogs.com/xenny/p/9739600.html

#include <string>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>

using namespace std;

int n,m;
int num[500005];

int lowbit(int x)
{
	return (-x)&x;
}

void add(int pos,int x)
{
	while(pos<=n)
	{
		num[pos]+=x;
		pos+=lowbit(pos);
	}
}

int query(int pos)
{
	int res=0;
	while(pos>0)
	{
		res+=num[pos];
		pos-=lowbit(pos);
	}
	return res;
}

int main()
{
	int t,cnt = 0;
	scanf("%d",&t);
	while(t--)
	{
		printf("Case %d:\n",++cnt);
		scanf("%d",&n);
		memset(num,0,sizeof(num));
		int a;
		for(int i=1; i<=n; i++)
		{
			scanf("%d",&a);
			add(i,a);
		}
		int x,y;
		string f;
		while(cin>>f&&f[0]!='E') {
			cin>>x>>y;
			if(f[0]=='A')
				add(x,y);
			else if(f[0]=='Q')
				cout<<query(y)-query(x-1)<<endl;
			else if(f[0]=='S')
				add(x,-1*y);
		}
	}
	return 0;
}