#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#define inf (1e10)
using namespace std;
int cmp(const void *xx,const void *yy)
{
int d1=*(int *)xx;
int d2=*(int *)yy;
if(d1<d2)return 1;
if(d1==d2)return 0;
return -1;
}
char ss[11];
int a[1100000],b[1100000],block[110000];
int main()
{
memset(a,63,sizeof(a));
memset(b,0,sizeof(b));
int n,m,size;
scanf("%d%d",&n,&m);
size=sqrt(n)+1;
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
for(int i=0;i<n;i+=size)
qsort(b+i,size,sizeof(int),cmp);
for(int t=1;t<=m;t++)
{
int op,l,r,c;
scanf("%s %d %d %d",ss+1,&l,&r,&c);
l--;r--;
if(ss[1]=='M')
{
bool change=false;
int now=l;
for(;now%size!=0&&now<=r;now++)
{
a[now]+=c;
change=true;
}
if(change==true)
{
int x=(now-1)/size*size;
for(int i=0;i<size;i++)
b[x+i]=a[x+i];
qsort(b+x,size,sizeof(int),cmp);
}
for(;now+size-1<=r;now+=size)
block[now/size]+=c;
change=false;
for(;now<=r;now++)
{
a[now]+=c;
change=true;
}
if(change==true)
{
int x=r/size*size;
for(int i=0;i<size;i++)
b[x+i]=a[x+i];
qsort(b+x,size,sizeof(int),cmp);
}
}
else
{
int now=l,ans=0,val=c;
for(;now%size!=0&&now<=r;now++)
if(a[now]+block[now/size]>=val)
ans++;
for(;now+size-1<=r;now+=size)
{
int l=now,r=now+size-1,add=now-1;
int mid=(l+r)/2;
while(l<=r)
{
if(b[mid]+block[mid/size]>=val)
{
add=mid;
l=mid+1;
}else r=mid-1;
mid=(l+r)/2;
}
ans+=add-now+1;
}
for(;now<=r;now++)
if(a[now]+block[now/size]>=val)
ans++;
printf("%d\n",ans);
}
}
return 0;
}
[bzoj3343] 教主的魔法
最新推荐文章于 2019-07-25 12:37:36 发布