分块 （区间修改，区间查询

比较常规的操作，用树状数组和线段树等都行。复杂度就不分析了

题目链接https://loj.ac/problem/6279

#include<bits/stdc++.h>


using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
const int inf = 0x3f3f3f3f;
int dir[10][10] = {{1,0},{-1,0},{0,1},{0,-1}};
ll sum[maxn],a[maxn],lz[maxn];
int opt,l,r,c,n,t,L[maxn],R[maxn],pos[maxn];

inline int read()
{
    char ch = getchar(); ll k = 0, f = 1;
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') {k = (k<<1) + (k<<3) + ch - '0'; ch = getchar();}
    return k * f;
}

inline 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]] += (r - l + 1) * c;
    }
    
    else
    {
        for(int i = l; i <= R[pos[l]]; ++i) a[i] += c;
        sum[pos[l]] += (R[pos[l]] - l + 1) * c;
        for(int i = L[pos[r]]; i <= r; ++i) a[i] += c;
        sum[pos[r]] += (r - L[pos[r]] + 1) * c;
        for(int i = pos[l] + 1; i <= pos[r] - 1; ++i) sum[i] += (R[i] - L[i] +1 ) * c, lz[i] += c;
    }

}

inline ll findy(int l,int r,int c)//查询
{
    ll ans = 0;
    if(pos[l] == pos[r])
    {
        for(int i = l; i <= r; ++i) ans += (a[i] + lz[pos[l]]), ans %= (c + 1);
    }
    
    else
    {
        for(int i = l; i <= R[pos[l]]; ++i) ans += (a[i] + lz[pos[l]]), ans %= (c + 1);
        for(int i = L[pos[r]]; i <= r; ++i) ans += (a[i] + lz[pos[r]]), ans %= (c + 1);
        for(int i = pos[l] + 1; i <= pos[r] - 1; ++i)
        {
            ans += sum[i], ans %= (c + 1);
        }
        
    }
    return ans %= (c + 1);
}

int main()
{
    n=read();
    for(int i = 1; i <= n; ++i) cin>>a[i];
    t = sqrt(n);
    for(int i = 1; i <= t; ++i)
    {
        L[i] = (i-1) * t + 1;
        R[i] = i * t;
    }
    
    if(R[t] != n) t++, L[t] = R[t - 1] + 1 ,R[t] = n;
    for(int i = 1; i <= t; ++i)
    {
        for(int j = L[i]; j <= R[i]; ++j)
        {
            pos[j] = i; sum[i] += a[j];
        }
        
    }

    for(int i = 1; i <= n; ++i)
    {
        opt = read(); l = read(); r = read(); c=read();
        if(opt == 0) add(l, r, c);
        else cout<<findy(l, r, c)<<endl;

    }
    return 0;
}