线段树模板

#define _CRT_SECURE_NO_WARNINGS
#define ls cur << 1
#define rs cur << 1 | 1
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 5e5 + 10;
int a[N], t[N << 2];
void build(int cur, int l, int r)
{
	if (l == r)
	{
		t[cur] = a[l]; return;
	}
	int mid = l + r >> 1;
	build(ls, l, mid), build(rs, mid + 1, r);
	t[cur] = t[rs] + t[ls]; //merge
}
void modify(int cur, int l, int r, int x, int k)
{
	if (l == r)
	{
		t[cur] += k; return; 
	}
	int mid = l + r >> 1;
	if (x <= mid)modify(ls, l, mid, x, k);
	else modify(rs, mid + 1, r, x, k);
	t[cur] = t[ls] + t[rs]; //merge
}
int query(int cur, int l, int r, int x, int y)
{
	if (x <= l && r <= y)
		return t[cur];
	int mid = l + r >> 1; int ans = 0;
	if (x <= mid)ans += query(ls, l, mid, x, y);
	if (y >= mid + 1)ans += query(rs, mid + 1, r, x, y);
	return ans;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	mt19937_64 mrand(time(0));
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)cin >> a[i];
	build(1, 1, n);
	while (m--)
	{
		int op; cin >> op;
		if (op & 1)
		{
			int x, k; cin >> x >> k;
			modify(1, 1, n, x, k);
		}
		else
		{
			int x, y; cin >> x >> y;
			cout << query(1, 1, n, x, y) << '\n';
		}
	}
	return 0;
}