线段树（只适用区间更新，单点查询）

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
struct node
{
    int l , r, sum;
}tree[5000000];
int input[5000000],n,m;
void build(int i ,int l , int r)
{
    tree[i].l = l , tree[i].r = r;
    if(l == r) {
        tree[i].sum = input[l];
        return ;
    }
    int mid = (l+r)/2;
    build(i*2,l,mid);
    build(i*2+1,mid+1,r);
    tree[i].sum = tree[i*2].sum + tree[i*2+1].sum;
}
int search(int i, int l , int r)
{
    if(tree[i].l>=l && tree[i].r <= r)
        return tree[i].sum;
    if(tree[i].l > r || tree[i].r < l)
        return 0;
    int ans = 0;
    if(tree[i*2].r >= l)
        ans += search(i*2,l,r);
    if(tree[i*2+1].l <= r)
        ans += search(i*2+1,l,r);
    return ans;
}
void add(int i , int dis, int k)
{
    if(tree[i].l == tree[i].r) {
        tree[i].sum += k;
        return;
    }
    if(dis <= tree[i*2].r)
        add(i*2,dis,k);
    else
        add(i*2+1,dis,k);
    tree[i].sum = tree[i*2].sum + tree[i*2+1].sum;
    return ;
}
int main(void)
{
    scanf("%d %d",&n,&m);
    for(int i = 1 ; i <= n ; i ++)
        scanf("%d",&input[i]);
    build(1,1,n);
    for(int i = 1 ;  i <= m ; i ++)
    {
        int p , x , y;
        scanf("%d %d %d",&p,&x,&y);
        if(p == 1)
            add(1,x,y);
        else
            printf("%d\n",search(1,x,y));
    }
}