分块 （区间加，区间乘，单点查询

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

#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}};
const int mod = 10007;
int add[maxn], mul[maxn], v[maxn];//记录区间存的加法 区间存的乘法 原数组
int opt, a, b, c, t, pos[maxn], l[maxn], r[maxn];

inline int read()
{
    char ch = getchar(); int 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 reset(int x) //更新原数组
{
    for(int i = l[x]; i <= r[x]; ++i)
    {
        v[i] = (v[i] * mul[x] + add[x]) % mod;
    }
    add[x] = 0, mul[x] = 1; // 记得还原
}

inline void inser(int a,int b,int c,int k)
{
    int pa = pos[a], pb = pos[b];
    if(pa == pb)
    {
        reset(pa);
            for(int i = a; i <= b; ++i)
            {
                if(k == 0) v[i] += c;
                else v[i] *= c;
                v[i] %= mod;
            }
    }
    else
    {
        reset(pa);
        for(int i = a; i <= r[pa]; ++i)
        {
            if(k == 0) v[i] += c;
            else v[i] *= c;
            v[i] %= mod;
        }
        reset(pb);
        for(int i = l[pb]; i <= b; ++i)
        {
            if(k == 0) v[i] += c;
            else v[i] *= c;
            v[i] %= mod;
        }
        for(int i = pa + 1;i <= pb - 1; ++i)
        {
            if(k == 0) add[i] += c;
            else add[i] *= c, mul[i] *= c; //进行乘法区间更新时如果add数组(加法)存在值,必然需要使其乘上需要乘的数才能保证正确性。
            add[i] %= mod; mul[i] %= mod;
        }
    }
}

int main()
{
    int n;
    n = read();
    for(int i = 1; i <= n; ++i)
    {
        v[i]=read();
    }
    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) mul[i] = 1;
    for(int i = 1; i <= t; ++i)
    {
        for(int j = l[i]; j <= r[i]; ++j)
        {
            pos[j] = i;
        }
    }
    for(int i = 1; i <= n; ++i)
    {
        opt = read(); a = read(); b = read(); c = read();
        if(opt != 2) inser(a, b, c, opt);
        if(opt == 2) cout<<(v[b] * mul[pos[b]] + add[pos[b]]) % mod<<endl;
    }
    return 0;
}