【树状数组+差分】ACW242. 一个简单的整数问题

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <set>
#include <bitset>


using namespace std;

// 使用差分存储元素
using ll = long long;
const int N = 1e5 + 100;
int n, m;
ll nums[N], tree[N];

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

inline void add(int x, int c) {
    for (int i = x; i <= n; i += lowbit(i))
        tree[i] += c;
}

inline ll ask(int x) {
    ll sum = 0;
    for (int i = x; i; i -= lowbit(i)) {
        sum += tree[i];
    }
    return sum;
}

int main() {
    ios::sync_with_stdio(false);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> nums[i];
    }
    // 差分存储元素
    for (int i = 1; i <= n; i++) {
        add(i, nums[i] - nums[i - 1]);
    }
    while (m--) {
        int l, r, d;
        char op;
        cin >> op;
        if (op == 'C') {
            cin >> l >> r >> d;
            // 对前d项元素求和没影响
            add(l, d);
            // 消除对r后面的元素求和的影响
            add(r + 1, -d);
            // 通过以上两部使得对l-r内元素求和会加上
        } else {
            cin >> l;
            cout << ask(l) << endl;
        }
    }
    return 0;
}