因为不用区间修改所以没加懒标记

大佬帮帮我吧！

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5+5;
long long val[MAXN];
struct Node{
    long long left, right, sum;
}tree[MAXN * 4];

void build (int k, int l, int r) {
    tree[k].left = l;
    tree[k].right = r;
    if (l == r) {
        tree[k].sum = val[l];
        return;
    }
    int mid, leftPoint, rightPoint;
    mid = (l + r) / 2;
    leftPoint = k * 2;
    rightPoint = k * 2 + 1;
    build(leftPoint, l, mid);
    build(rightPoint, mid + 1, r);
    tree[k].sum = tree[leftPoint].sum + tree[rightPoint].sum;
    return;
}

void update(int k, int i, int v) {
    if (tree[k].left == tree[k].right and tree[k].right == i) {
        tree[k].sum = v;
        return ;
    }
    int mid, leftPoint, rightPoint;
    mid = (tree[k].left + tree[k].right) / 2;
    leftPoint = k * 2;
    rightPoint = k * 2 + 1;
    if (i <= mid) {
        update(leftPoint, i, v);
    } else {
        update(rightPoint, i, v);
    }
    tree[k].sum = tree[leftPoint].sum + tree[rightPoint].sum;
    return;
}

long long query(int k, int l, int r) {
    if (tree[k].left >= l and tree[k].right <= r) {
        return tree[k].sum;
    }
    int mid, leftPoint, rightPoint;
    mid = (tree[k].left + tree[k].right) / 2;
    leftPoint = k * 2;
    rightPoint = k * 2 + 1;
    long long ans = 0;
    if (l <= mid) {
        ans += query(leftPoint, l, r);
    } 
    if (r > mid) {
        ans += query(rightPoint, l, r);
    }
    return ans;
}

void print(int k) {
    if (tree[k].sum) {
        cout << k << "\t" << tree[k].left << "\t" << tree[k].right << "\t" << tree[k].sum << "\t" << endl;
        print(k * 2);
        print(k * 2 + 1);
    }
}


int n, m;
int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", &val[i]);
	}
	build(1, 1, n);
	for (int i = 1; i <= m; i++) {
		long long op, a, b;
		scanf("%lld%lld%lld", &op, &a, &b);
		if (op == 1) {
			long long tmp = b + val[a];
			update(1, a, tmp);
		}
		if (op == 2) {
			printf("%lld\n", query(1, a, b));
		}
	}
	return 0;
}