bzoj2821

其实和bzoj2724是一样的
都是先处理多个块的答案，然后多余部分暴力
空间要注意一下，还是O(nsqrt(n));

var f:array[0..320,0..320] of longint;
    g:array[0..317,0..100001] of longint;
    a,s,be:array[0..100001] of longint;
    t,n,p,m,i,x,y,ans,size:longint;

procedure swap(var a,b:longint);
  var c:longint;
  begin
    c:=a;
    a:=b;
    b:=c;
  end;

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

procedure pre;
  var i,j,k:longint;
  begin
    for i:=1 to t do
    begin
      k:=min(n,i*size);
      g[i]:=g[i-1];
      for j:=(i-1)*size+1 to k do
        inc(g[i,a[j]]);
    end;
    for i:=1 to t do
    begin
      fillchar(s,sizeof(s),0);
      for j:=(i-1)*size+1 to n do
      begin
        inc(s[a[j]]);
        if j=(be[j]-1)*size+1 then
          f[i,be[j]]:=f[i,be[j]-1];
        if s[a[j]]>=2 then
          if s[a[j]] mod 2=1 then dec(f[i,be[j]]) else inc(f[i,be[j]]);
      end;
    end;
  end;

procedure clear(x,y:longint);
  var i:longint;
  begin
    for i:=x to y do
      s[a[i]]:=0;
  end;

function ask(x,y:longint):longint;
  var i:longint;
  begin
    ask:=0;
    if be[x]=be[y] then
    begin
      for i:=x to y do
      begin
        inc(s[a[i]]);
        if s[a[i]]>=2 then
          if s[a[i]] mod 2=1 then dec(ask) else inc(ask);
      end;
      clear(x,y);
    end
    else begin
      ask:=f[be[x]+1,be[y]-1];
      for i:=x to be[x]*size do
      begin
        if s[a[i]]=0 then s[a[i]]:=g[be[y]-1,a[i]]-g[be[x],a[i]];
        inc(s[a[i]]);
        if s[a[i]]>=2 then
          if s[a[i]] mod 2=1 then dec(ask) else inc(ask);
      end;
      for i:=(be[y]-1)*size+1 to y do
      begin
        if s[a[i]]=0 then s[a[i]]:=g[be[y]-1,a[i]]-g[be[x],a[i]];
        inc(s[a[i]]);
        if s[a[i]]>=2 then
          if s[a[i]] mod 2=1 then dec(ask) else inc(ask);
      end;
      clear(x,be[x]*size);
      clear((be[y]-1)*size+1,y);
    end;
  end;

begin
  readln(n,p,m);
  size:=trunc(sqrt(n));
  for i:=1 to n do
  begin
    read(a[i]);
    be[i]:=(i-1) div size+1;
  end;
  t:=n div size;
  if n mod size<>0 then inc(t);
  pre;
  fillchar(s,sizeof(s),0);
  for i:=1 to m do
  begin
    readln(x,y);
    x:=(x+ans) mod n+1;
    y:=(y+ans) mod n+1;
    if x>y then swap(x,y);
    ans:=ask(x,y);
    writeln(ans);
  end;
end.