分块
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<cstdlib> #include<algorithm> #include<iomanip> #include<map> using namespace std; #define ll long long inline ll read() { ll x=0;int f=1;char ch=getchar();bool flag=0; while(ch<'0'||(ch>'9'&&ch<'A')||ch>'Z'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();flag=1;} if(flag)return x; if(ch=='A')return 1; if(ch=='M')return 2; } inline void write(ll x) { if(x==0)putchar('0'); if(x<0)putchar('-'),x=-x; int temp[30]={0}; while(x){temp[++temp[0]]=x;x/=10;} while(temp[0]){putchar(temp[temp[0]--]+'0');} } const int N=1000010; int n,q,m,block; int a[N],b[N],pos[N],add[N]; inline void reset(int x) { int l=(x-1)*block+1,r=min(x*block,n); for(int i=l;i<=r;i++) b[i]=a[i];sort(b+l,b+r+1); } void update(int x,int y,int v) { if(pos[x]==pos[y])for(int i=x;i<=y;i++)a[i]=a[i]+y; else { for(int i=x;i<=pos[x]*block;i++)a[i]+=v; for(int i=(pos[y]-1)*block+1;i<=y;i++)a[i]+=v; } reset(pos[x]);reset(pos[y]); for(int i=pos[x]+1;i<pos[y];i++) add[i]+=v; } int find(int x,int v) { int l=(x-1)*block+1,r=min(n,block*x); int laster=r; while(l<=r) { int mid=l+r>>1; if(b[mid]<v)l=mid+1; else r=mid-1; }return laster-l+1; } int query(int x,int y,int v) { int sum=0; if(pos[x]==pos[y]) {for(int i=x;i<=y;i++)if(a[i]+add[pos[i]]>=v)sum++;} else { for(int i=x;i<=pos[x]*block;i++) if(a[i]+add[pos[i]]>=v)sum++; for(int i=(pos[y]-1)*block+1;i<=y;i++) if(a[i]+add[pos[i]]>=v)sum++; } for(int i=pos[x]+1;i<pos[y];i++) sum+=find(i,v-add[i]); return sum; } int main() { scanf("%d%d",&n,&q); block=int(sqrt(n)); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); pos[i]=(i-1)/block+1; b[i]=a[i]; } if(n%block)m=n/block+1; else m=n/block; for(int i=1;i<=m;i++)reset(i); for(int i=1;i<=q;i++) { char ch[5];int x,y,v; scanf("%s%d%d%d",ch,&x,&y,&v); if(ch[0]=='M')update(x,y,v); else write(query(x,y,v)),puts(""); } return 0; }