树状数组板子

#include<bits/stdc++.h> 
using namespace std;
const int N = 100005;
int a[N], tr[N];
int n, m, k, x, y;
int lowbit(int x) {
	return x & -x;
}
void add(int x, int v) {
	for(int i = x; i <= n; i += lowbit(i)) {
		tr[i] += v;
	}
}
int sum(int x) {
	int cnt = 0;
	for(int i = x; i; i -= lowbit(i)) {
		cnt += tr[i];
	}
	return cnt;
}
int main() {
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		add(i, a[i]);
	}
	while(m--) {
		cin >> k >> x >> y;
		if(k) {
			add(x, y);
		} else {
			cout << sum(y) - sum(x - 1) << endl;
		}
	}
	return 0;
}