P3374 模板树状数组 1

Posted 2021-10-30 幽殇默

https://www.luogu.com.cn/problem/P3374

#include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
const int N=1e5*5+10;
LL tr[N],a[N],n,m;
int lowbit(int x){return x&(-x);}
void add(int x,int c)
{
	for(int i=x;i<=n;i+=lowbit(i)) tr[i]+=c;
}
LL query(int x)
{
	LL res=0;
	for(int i=x;i;i-=lowbit(i)) res+=tr[i];
	return res;
}
int main(void)
{
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) add(i,a[i]);
	while(m--)
	{
		int op,l,r; cin>>op>>l>>r;
		if(op==1) add(l,r);
		else cout<<query(r)-query(l-1)<<endl;
	}
	return 0;
}