bzoj3343: 教主的魔法

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#include<cmath>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
#define clr(x,c) memset(x,c,sizeof(x))
int read(){
    int x=0,f=1;char c=getchar();
    while(!isdigit(c)){
        if(c==‘-‘) f=-1;c=getchar();
    }
    while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
    return x*f;
} 
const int nmax=1e6+5;
int a[nmax],b[nmax],bel[nmax],add[nmax],n,m,bck;char s[10];
void reset(int x){
    int l=(x-1)*bck+1,r=min(x*bck,n);
    rep(i,l,r) b[i]=a[i];
    sort(b+l,b+r+1);
}
void update(int u,int v,int d){
    if(bel[u]==bel[v]) {
        rep(i,u,v) a[i]+=d;reset(bel[u]);
    }else{
        rep(i,u,bel[u]*bck) a[i]+=d;
        rep(i,(bel[v]-1)*bck+1,v) a[i]+=d;
        reset(bel[u]);reset(bel[v]);
    }
    rep(i,bel[u]+1,bel[v]-1) add[i]+=d;
}
int find(int x,int d){
    int l=(x-1)*bck+1,r=x*bck,mid,ans=r+1,res=r;
    while(l<=r){
        mid=(l+r)>>1;
        if(b[mid]>=d) ans=mid,r=mid-1;
        else l=mid+1;
    }
    return res-ans+1;
}
int query(int u,int v,int d){
    int ans=0;
    if(bel[u]==bel[v]) {
        int tmp=add[bel[u]];
        rep(i,u,v) if(a[i]+tmp>=d) ans++;
    }else{
        int tmp=add[bel[u]],temp=add[bel[v]];
        rep(i,u,bel[u]*bck) if(a[i]+tmp>=d) ans++;
        rep(i,(bel[v]-1)*bck+1,v) if(a[i]+temp>=d) ans++;
    }
    rep(i,bel[u]+1,bel[v]-1) ans+=find(i,d-add[i]);
    return ans;
}
int main(){
    n=read(),m=read(),bck=(int)sqrt(n);int u,v,d;
    rep(i,1,n) b[i]=a[i]=read(),bel[i]=(i-1)/bck+1;
    int sum=(n%bck==0)?n/bck:n/bck+1;
    rep(i,1,sum-1) sort(b+(i-1)*bck+1,b+i*bck+1);
    sort(b+(sum-1)*bck+1,b+n+1);
    rep(i,1,m) {
        scanf("%s",s);u=read(),v=read(),d=read();
        if(s[0]==‘M‘) update(u,v,d);
        else printf("%d\n",query(u,v,d));
    }
    return 0;
}