Libre OJ #6277. 数列分块入门 1

Code:

#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define ull unsigned LL
#define ls i << 1
#define rs (i << 1) + 1
#define fi first
#define se second
#define CLR(a) while(!(a).empty()) a.pop()

using namespace std;

const int maxn = 5e4 + 10;
int a[maxn],n;
int block,num,belong[maxn],l[maxn],r[maxn];
int lazy[maxn];

inline int read() {
    int X = 0, w = 0;
    char ch = 0;
    while(!isdigit(ch)) {
        w |= ch == '-';
        ch = getchar();
    }
    while(isdigit(ch))
        X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
    return w ? -X : X;
}

void build(){
    block = sqrt(n);
    num = n / block; if(n % block) ++ num;
    for(int i = 1;i <= num;++ i){
        l[i] = (i - 1) * block + 1;
        r[i] = i * block;
    }
    r[num] = n;
    for(int i = 1;i <= n;++ i)
        belong[i] = (i - 1) / block + 1;
}

void update(int x,int y,int val){
    if(belong[x] == belong[y]){
        for(int i = x;i <= y;++ i)
            a[i] += val;
        return ;
    }
    for(int i = x;i <= r[belong[x]];++ i)
        a[i] += val;
    for(int i = belong[x] + 1;i <= belong[y] - 1;++ i)
        lazy[i] += val;
    for(int i = l[belong[y]];i <= y;++ i)
        a[i] += val;
}

int main() {
    n = read();
    for(int i = 1;i <= n;++ i)
        a[i] = read();
    build();
    while(n --){
        int op = read(),x = read(),y = read(),c = read();
        if(!op)
            update(x,y,c);
        else printf("%d\n",a[y] + lazy[belong[y]]);
    }
    return 0;
}