树状数组

树状数组

单点修改，区间查询

#include <iostream>
#include <cstdio>
using namespace std;
#define ll long long
const int N = 1e6 + 5;
int n, q;
ll bit[N]; //bit[x] = A[i - 2^k + 1] + A[i - 2^k + 2] + ...... + A[i](k为i的二进制中从最低位到高位连续零的长度)

int lowbit(int x) { return x & (-x);}

void add(int x, ll t)
{
    for (; x <= n; x += lowbit(x))
        bit[x] += t;
}

ll sum(int x) //sum = bit[i] + bit[i - 2^k1] + bit[(i - 2^k1) - 2^k2] + ......;
{
    ll s = 0;
    for (; x >= 1; x -= lowbit(x)) {
        s += bit[x];
    }
    return s;
}

int main()
{
    int a, b, c;
    ll x;
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &x);
        add(i, x);
    }
    while (q--) {
        scanf("%d%d%d", &a, &b, &c);
        if (a == 1) add(b, c);
        else {
            x = sum(c) - sum(b - 1);
            printf("%lld\n", x);
        }
    }
    return 0;
}

区间修改，单点查询

#include <iostream>
#include <cstdio>
using namespace std;
#define ll long long
const int N = 1e6 + 5;
int n, q;
ll d[N]; //a[i] = sum(d[i]); d[i] = a[i] - a[i - 1];

int lowbit(int x) { return x & (-x);}

void add(int x, ll t)
{
    for (; x <= n; x += lowbit(x))
        d[x] += t;
}

ll sum(int x)
{
    ll s = 0;
    for (; x; x -= lowbit(x))
        s += d[x];
    return s;
}

int main()
{
    int a, b, c, d;
    ll x;
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &x);
        add(i, x);
        add(i + 1, -x);
    }
    while (q--) {
        scanf("%d", &a);
        if (a == 1) {
            scanf("%d%d%d", &b, &c, &d);
            add(b, d);
            add(c + 1, -d);
        }
        else {
            scanf("%d", &b);
            printf("%lld\n", sum(b));
        }
    }
    return 0;
}

区间修改，区间查询

#include <iostream>
#include <cstdio>
using namespace std;
#define ll long long
const int N = 1e6 + 5;
ll n, q;
ll c1[N], c2[N], a[N];
// sum(a[n]) = sum(d[1]) + sum(d[2]) + ...... + sum(d[n])
// = n * d[1] + (n - 1) * d[2] + ...... + d[n]
// = n * sum(d[n]) - sum((n - 1) * d[n])
// = (n + 1) * sum(d[n]) - sum((n - 1) * d[n])
// (d[1] + d[2] + ... + d[n])
// (1*d[1] + 2*d[2] + ... + n*d[n]

ll lowbit(ll x) { return x & -x; }

void add(ll x, ll t)
{
    ll tmp = x;
    for (; x <= n; x += lowbit(x)) {
        c1[x] += t;
        c2[x] += t * tmp;
    }
}

ll sum(ll x) //sum(a[n])
{
    ll s = 0, tmp = x;
    for (; x; x -= lowbit(x))
        s += (tmp + 1) * c1[x] - c2[x];
    return s;
}

int main()
{
    ll op, l, r, t, x;
    scanf("%lld%lld", &n, &q);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
        add(i, a[i] - a[i - 1]); //输入初值的时候，也相当于更新了值
    }
    while (q--) {
        scanf("%lld%lld%lld", &op, &l, &r);
        if (op == 1) {
            scanf("%lld", &t);
            add(l, t);
            add(r + 1, -t);
        }
        else {
            x = sum(r) - sum(l - 1);
            printf("%lld\n", x);
        }
    }
    return 0;
}

二维树状数组

单点修改，区间查询

#include <iostream>
#include <cstdio>
using namespace std;
#define ll long long
const int N = (1 << 12) + 5;
int n, m;
ll c[N][N];

int lowbit(int x) { return x & (-x); }

void add(int x, int y, ll t)
{
    for (int i = x; i <= n; i += lowbit(i))
    for (int j = y; j <= m; j += lowbit(j)) {
        c[i][j] += t;
    }
}

ll sum(int x, int y)
{
    ll s = 0;
    for (int i = x; i; i -= lowbit(i))
        for (int j = y; j; j -= lowbit(j))
            s += c[i][j];
    return s;
}

int main()
{
    int op;
    scanf("%d%d", &n, &m);
    while (~scanf("%d", &op)) {
        if (op == 1) {
            int x, y;
            ll k;
            scanf("%d%d%lld", &x, &y, &k);
            add(x, y, k);
        }
        else {
            int a, b, c, d;
            scanf("%d%d%d%d", &a, &b, &c, &d);
            printf("%lld\n", sum(c, d) - sum(c, b - 1) - sum(a - 1, d) + sum(a - 1, b - 1));
        }
    }
    return 0;
}

区间修改，区间查询

#include <iostream>
#include <cstdio>
using namespace std;
#define ll long long
const ll N = (1 << 11) + 5;
ll n, m;
ll c[4][N][N];

ll lowbit(ll x) { return x & (-x); }

void add(ll x, ll y, ll d)
{
    for (ll i = x; i <= n; i += lowbit(i))
    for (ll j = y; j <= m; j += lowbit(j)) {
        c[0][i][j] += d;
        c[1][i][j] += d * x;
        c[2][i][j] += d * y;
        c[3][i][j] += d * x * y;
    }
}

ll sum(ll x, ll y)
{
    ll s = 0;
    for (ll i = x; i; i -= lowbit(i))
        for (ll j = y; j; j -= lowbit(j))
            s += (x + 1) * (y + 1) * c[0][i][j] - (y + 1) * c[1][i][j] - (x + 1) * c[2][i][j] + c[3][i][j];
    return s;
}

int main()
{
    ll op, x;
    scanf("%lld%lld", &n, &m);
    while (~scanf("%lld", &op)) {
        ll a, b, c, d;
        scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
        if (op == 1) {
            scanf("%lld", &x);
            add(a, b, x);
            add(a, d + 1, -x);
            add(c + 1, b, -x);
            add(c + 1, d + 1, x);
        }
        else {
            printf("%lld\n", sum(c, d) - sum(a - 1, d) - sum(c, b - 1) + sum(a - 1, b - 1));
        }
    }
    return 0;
}