0分求调

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 3e5 + 5;

int n;
int opt, l, r;
ll a[N], c[N], ans, k;

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

void insert(int x, int k) {
    while (x <= n) {
        c[x] += k;
        x += lowbit(x);
    }
}

ll query(int x) {
    ll cnt = 0;
    while (x > 0) {
        cnt += c[x];
        x -= lowbit(x);
    }
    return cnt;
}

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