【模板】树状数组 洛谷P3374

#include<cstdio>
using namespace std;
int i,j,k,t,n,m,a[500001],tree[500001];
int lowbit(int x)
{
	return x&-x;
}
void add(int x,int y)
{
	while (x<=n)
	{
		tree[x]+=y;
		x+=lowbit(x);
	}
}
int sum(int x)
{
	int s=0;
	while (x>0)
	{
		s+=tree[x];
		x-=lowbit(x);
	}
	return s;
}
int main()
{
	scanf("%d%d",&n,&m);
	for (i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		add(i,a[i]);
	}
	for (i=1;i<=m;i++)
	{
		scanf("%d",&t);
		if (t==1)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			add(x,y);
		}
		else
		{
			int x,y;
			scanf("%d%d",&x,&y);
			printf("%d\n",sum(y)-sum(x-1));
		}
	}
}