Acwing 1264. 动态求连续区间和(树状数组版)

 lowbit(x): x & (-x) 返回2^k，k为x的二进制表示中末尾0的个数

c[x]存的是(x - lowbit(x)，x]之间这些数的和

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

const int N = 100010;

int n, m;
int a[N], tr[N];

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 query(int x)
{
    int res = 0;
    for (int i = x; i > 0; i -= lowbit(i)) res += tr[i];
    return res;
}

int main()
{
    scanf("%d %d", &n, &m);
    
    for (int i = 1; i <= n; ++ i) scanf("%d", &a[i]);
    for (int i = 1; i <= n; ++ i) add(i, a[i]);
    
    while (m --)
    {
        int k, x, y;
        scanf("%d %d %d", &k, &x, &y);
        if (k == 0) printf("%d\n", query(y) - query(x - 1));
        else add(x, y);
    }
    
    return 0;
}