树状数组模板 HDU1166

LiQiyaoo

于 2016-07-20 22:00:17 发布

阅读量305

点赞数

CC 4.0 BY-SA版权

分类专栏： acm 文章标签：树状数组

本文链接：https://blog.csdn.net/L_BestCoder/article/details/51972874

acm 专栏收录该内容

76 篇文章

订阅专栏

<strong><span style="font-size:18px;">#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int a[50005];
int tree[50005];//树状数组 
char s[20];
int n;
void add(int k, int num)
{
	while(k <= n)
	{
		tree[k] += num;
		k += k & (-k);//lowbit(k) 
	}
}
int search(int k)
{
	int sum=0;
	while(k)
	{
		sum += tree[k];
		k -= k & (-k);
	}
	return sum;
}
int main()
{
	int cases, i, j, x, y;
	j = 1;
	cin>>cases;
	while(cases--)
	{
		memset(tree, 0, sizeof(tree));
		printf("Case %d:\n",j++);
		scanf("%d", &n);
		for(i = 1; i <= n; i++)
		{
			scanf("%d", &a[i]);
			add(i, a[i]);
		} 
		while(scanf("%s", s) != EOF)
		{
			if(strcmp(s, "End") == 0)
			{
				break;
			}
			else if(strcmp(s, "Query") == 0)
			{
				scanf("%d%d", &x, &y);
				int ans = search(y) - search(x-1);
				cout<<ans<<endl;
			}
			else if(strcmp(s, "Add") == 0)
			{
				scanf("%d%d", &x, &y);
				add(x, y);
			}
			else
			{
				scanf("%d%d", &x, &y);
				add(x, -y);
			}
		}
	}
	return 0;
}
</span></strong>