bzoj3343

分块大法好！
考虑分块，首先对每块内进行排序；
对于修改，对于整块的修改，显然只要打一个标记就可以了；
不是整块就暴力修改，然后对那个块重新排序；
这样查询的时候就可以做到在整块内二分，非整块暴力查找即可
显然块取sqrt(n)合适，时间复杂度为O(nsqrt(n)*logn)

var a,b,c,be:array[0..1000010] of longint;
    i,m,n,x,y,z,size,q:longint;
    ch:char;

function min(a,b:longint):longint;
  begin
    if a>b then exit(b) else exit(a);
  end;

procedure sort(l,r: longint);
  var i,j,x,y: longint;
  begin
    i:=l;
    j:=r;
    x:=b[(l+r) div 2];
    repeat
      while b[i]<x do inc(i);
      while x<b[j] do dec(j);
      if not(i>j) then
      begin
        y:=b[i];b[i]:=b[j];b[j]:=y;
        inc(i);
        j:=j-1;
      end;
    until i>j;
    if l<j then sort(l,j);
    if i<r then sort(i,r);
  end;


function getans(x,z:longint):longint;
  var l,r,m,p:longint;
  begin
    l:=(x-1)*size+1;
    r:=min(l+size-1,n);
    p:=r;
    while l<=r do
    begin
      m:=(l+r) shr 1;
      if (b[m]<z) then l:=m+1 else r:=m-1;
    end;
    exit(p-l+1);
  end;

procedure work(x:longint);
  var l,r,i:longint;
  begin
    l:=(x-1)*size+1;
    r:=min(l+size-1,n);
    for i:=l to r do
      b[i]:=a[i];
    sort(l,r);
  end;

function ask(x,y,z:longint):longint;
  var i:longint;
  begin
    if be[y]=be[x] then
    begin
      ask:=0;
      for i:=x to y do
        if a[i]+c[be[x]]>=z then ask:=ask+1;
    end
    else begin
      ask:=0;
      for i:=be[x]+1 to be[y]-1 do
        ask:=ask+getans(i,z-c[i]);
      for i:=x to be[x]*size do
        if a[i]>=z then inc(ask);
      for i:=(be[y]-1)*size+1 to y do
        if a[i]>=z then inc(ask);
    end;
  end;

procedure change(x,y,z:longint);
  var i:longint;
  begin
    if be[y]=be[x] then
    begin
      for i:=x to y do
        a[i]:=a[i]+z;
      work(be[x]);
    end
    else begin
      for i:=be[x]+1 to be[y]-1 do
        c[i]:=c[i]+z;
      for i:=x to be[x]*size do
        a[i]:=a[i]+z;
      work(be[x]);
      for i:=(be[y]-1)*size+1 to y do
        a[i]:=a[i]+z;
      work(be[y]);
    end;
  end;

begin
  readln(n,q);
  size:=trunc(sqrt(n));
  for i:=1 to n do
  begin
    read(a[i]);
    be[i]:=(i-1) div size+1;
  end;
  readln;
  m:=n div size;
  if n mod size>0 then inc(m);
  for i:=1 to m do
    work(i);
  for i:=1 to q do
  begin
    readln(ch,x,y,z);
    if ch='A' then writeln(ask(x,y,z))
    else change(x,y,z);
  end;
end.