#6278. 数列分块入门 2

https://loj.ac/problem/6278 

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

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-8
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------

const int maxn=1e5+9;
const int mod=1e9+7;

int a[maxn];
int add[maxn],Be[maxn];
int le[maxn],ri[maxn];
vector<int>v[maxn];
int unit=0;
void resort(int id)
{
    v[id].clear();
    int bl=le[id];
    int br=ri[id];
    for(int i=bl;i<=br;i++) v[id].pb(a[i]);
    sort(v[id].begin(),v[id].end());
}

void update(int l,int r,int val)
{
    int bl=Be[l];
    int br=Be[r];
    if(bl==br)
    {
        for(int i=l;i<=r;i++)a[i]+=val;
        resort(bl);
    }
    else
    {
        for(int i=bl+1;i<=br-1;i++)
        {
            add[i]+=val;
        }
        if(l<=ri[bl])
        {
            for(int i=l;i<=ri[bl];i++) a[i]+=val;
            resort(bl);
        }
        if(le[br]<=r)
        {
            for(int i=le[br];i<=r;i++) a[i]+=val;
            resort(br);
        }

    }

}
int query(int l,int r,int val)
{
    int ans=0;
    int bl=Be[l];
    int br=Be[r];
    if(bl==br)
    {
        for(int i=l;i<=r;i++)if(a[i]+add[bl]<val) ans++;
    }
    else
    {
        for(int i=bl+1;i<=br-1;i++)
        {
            int num=lower_bound(v[i].begin(),v[i].end(),val-add[i])-v[i].begin();
            ans+=num;
        }
        if(l<=ri[bl])
        {
            for(int i=l;i<=ri[bl];i++) if(a[i]+add[bl]<val) ans++;
        }
        if(le[br]<=r)
        {
            for(int i=le[br];i<=r;i++) if(a[i]+add[br]<val) ans++;
        }

    }
    return ans;
}
int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);

    int n;
    //n=read();
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    unit=(int)sqrt(n);
    int tot=(n-1)/unit+1;
    for(int i=1;i<=n;i++)
    {
        Be[i]=(i-1)/unit+1;
        if(!le[Be[i]]) le[Be[i]]=i;
        ri[Be[i]]=i;
        v[Be[i]].pb(a[i]);
    }

    for(int i=1;i<=tot;i++) sort(v[i].begin(),v[i].end());

    for(int i=1;i<=n;i++)
    {
        int op,l,r,c;
        cin>>op>>l>>r>>c;
        if(op==0)
        {
            update(l,r,c);
        }
        else
        {
            cout<<query(l,r,c*c)<<endl;
        }
    }

    return 0;
}