bzoj 3343: 教主的魔法

分块；对每一块维护一个有序数列，与一个标记，如果修改了不好用了就暴力重建；

#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=(n);i++)
using namespace std;
const int maxn=1000005;
typedef long long ll;
int a[maxn],b[maxn],add[maxn],pos[maxn],block,n,q,m;
void reset(int x){
    int l=(x-1)*block+1,r=min(x*block,n);
    rep(i,l,r)b[i]=a[i];
    sort(b+l,b+r+1);
}
char s[20];
void change(int l,int r,int M){
    rep(i,l,pos[l]*block)a[i]+=M;reset(pos[l]);
    rep(i,(pos[r]-1)*block+1,r)a[i]+=M;reset(pos[r]);
    rep(i,pos[l]+1,pos[r]-1)add[i]+=M;
}
int find(int x,int v){
    int l=(x-1)*block+1,r=min(x*block,n);
    while(l<=r){int mid=(l+r)>>1;
    if(b[mid]<v)l=mid+1;
    else r=mid-1;
    }return min(x*block,n)-l+1;
}
int ask(int l,int r,int c){
    int ans=0;
    rep(i,l,pos[l]*block)if(a[i]+add[pos[i]]>=c)ans++;
    rep(i,(pos[r]-1)*block+1,r)if(a[i]+add[pos[i]]>=c)ans++;
    rep(i,pos[l]+1,pos[r]-1)ans+=find(i,c-add[i]);
    return ans;
}
int main(){//freopen("in.in","r",stdin);
    scanf("%d%d",&n,&q);
    block=sqrt(n);
    m=n/block+(n%block ? 1 : 0);
    rep(i,1,n){scanf("%d",&a[i]);pos[i]=(i-1)/block+1;}
    rep(i,1,m)
    reset(i);
    int l,r,c;
    rep(i,1,q){
        scanf("%s%d%d%d",s,&l,&r,&c);
        if(s[0]=='M')change(l,r,c);
        else printf("%d\n",ask(l,r,c));
    }
}