数列分块入门 4

传送门

---

本题是分块入门第一题的加强。
修改操作，对于整块额外用个 $sum$ 数组记录每个块内元素的和，对块内所有元素的和直接修改；不完整的块则暴力修改，同时也要更新 $sum$ 数组 。
查询操作，对于整块直接相加，不完整的块依旧暴力相加即可。

代码：

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

typedef long long ll;

const int N = 50010, M = 310;

int n, m, pos[N];
ll a[N], lazy[M], sum[M];

int ask(int l, int r, ll p)
{
    int ans = 0;
    if (pos[l] == pos[r])
    {
        for (int i = l; i <= r; i++)        
            ans = ((ll)ans + a[i] + lazy[pos[l]]) % p;
        return ans;
    }
    for (int i = pos[l] + 1; i < pos[r]; i++)
        ans = ((ll)ans + sum[i]) % p;
    for (int i = l; i <= min(pos[l] * m, n); i++)
        ans = ((ll)ans + a[i] + lazy[pos[l]]) % p;
    for (int i = (pos[r] - 1) * m + 1; i <= r; i++)
        ans = ((ll)ans + a[i] + lazy[pos[r]]) % p;
    return ans;
}

void add(int l, int r, int c)
{
    if (pos[l] == pos[r])
    {
        for (int i = l; i <= r; i++) a[i] += c;
        sum[pos[l]] += (ll)(r - l + 1) * c;
        return;
    }
    for (int i = pos[l] + 1; i < pos[r]; i++)
        lazy[i] += c, sum[i] += (ll)m * c;
    for (int i = l; i <= min(pos[l] * m, n); i++)
        a[i] += c, sum[pos[l]] += c;
    for (int i = (pos[r] - 1) * m + 1; i <= r; i++)
        a[i] += c, sum[pos[r]] += c;
}

int main()
{
    scanf("%d", &n);
    m = sqrt(n);
    for (int i = 1; i <= n; i++) 
    {
        scanf("%lld", &a[i]);
        pos[i] = (i - 1) / m + 1;
        sum[pos[i]] += a[i];
    }
    int t = n;
    while (t--)
    {
        int op, l, r, c;
        scanf("%d%d%d%d", &op, &l, &r, &c);
        if (op & 1)
            printf("%d\n", ask(l, r, (ll)(c + 1)));
        else
            add(l, r, c);
    }
    return 0;
}