LOJ - #6280. 数列分块入门 4

题目链接：https://loj.ac/problem/6280

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 5e4 + 5;
int blo, n, opt, l, r, c, pos[maxn];
ll atag[maxn], sum[maxn], a[maxn];
int add(int l, int r, int c)
{
   for (int i = l ; i <= min(pos[l]*blo, r); i++){
    a[i] += c;
    sum[pos[l]] += c;
   }
   if(pos[l] != pos[r]){
    for (int i = (pos[r]-1)*blo+1; i <= r; i++){

        a[i] += c;
        sum[pos[r]] += c;
    }
   }
   for (int i = pos[l]+1; i <= pos[r]-1; i++) atag[i] += c;
}
ll query(int l, int r)
{
   ll ans = 0;
   for (int i = l ; i <= min(pos[l]*blo, r); i++){
    ans += a[i] + atag[pos[l]];
   }
   if(pos[l] != pos[r])
    for(int i = (pos[r]-1)*blo+1; i <= r; i++){
    ans += a[i] + atag[pos[r]];
   }
   for (int i = pos[l] + 1; i <= pos[r]-1; i++) {
    ans += sum[i] + blo * atag[i];
   }

   return ans;
}
int main()
{
    scanf("%d", &n);
    blo = sqrt(n);
    for (int i = 1; i <= n; i++) scanf("%lld",&a[i]), pos[i] = (i - 1) / blo + 1, sum[pos[i]] += a[i];

    for (int i = 0; i < n; i++){
        scanf("%d%d%d%d", &opt, &l, &r, &c);
        if(opt == 0){
            add(l, r, c);
        }
        else{
            printf("%d\n", query(l, r)%(c+1));
        }
    }
    return 0;
}