[莫队] BZOJ5016: [Snoi2017]一个简单的询问

$ans=\sum_{x=0}^\infty (p_{x,r1}-p_{x,l1-1})(p_{x,r2}-p_{x,l2-1})$

展开得到

$$ans=\sum_{x=0}^\infty p_{x,r1}p_{x,r2}-\sum_{x=0}^\infty p_{x,r1}p_{x,l1-1}-\sum_{x=0}^\infty p_{x,r2}p_{x,l1-1}+\sum_{x=0}^\infty p_{x,l1-1}p_{x,l2-1}$$

那么只要维护 $\sum_{x=0}^\infty p_{x,a}p_{x,b}$ 就可以了…

用莫队维护

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long ll;

const int N=200010;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}

inline void read(int &x){
  char c=nc(); x=0;
  for(;c>'9'||c<'0';c=nc());for(;c>='0'&&c<='9';x=x*10+c-'0',c=nc());
}

int n,m,S,cnt,a[N],bl[N];
ll ans[N],cur;
int cl[N],cr[N];

struct Qry{
  int g,a,b,c;
  friend bool operator <(Qry x,Qry y){
    if(bl[x.a]!=bl[y.a]) return bl[x.a]<bl[y.a];
    return bl[x.a]&1?x.b<y.b:x.b>y.b;
  }
}Q[N];

void PutAns(ll x){
  if(x>=10) PutAns(x/10); putchar(x%10+'0');
}

int main(){
  freopen("1.in","r",stdin);
  freopen("1.out","w",stdout);
  read(n); S=sqrt(n);
  for(int i=1;i<=n;i++) read(a[i]);
  for(int i=1;i<=n;i++) bl[i]=(i-1)/S+1;
  read(m);
  for(int i=1,l1,r1,l2,r2;i<=m;i++){
    read(l1); read(r1); read(l2); read(r2);
    Q[++cnt]=(Qry){i,r1,r2,1};
    Q[++cnt]=(Qry){i,r1,l2-1,-1};
    Q[++cnt]=(Qry){i,l1-1,r2,-1};
    Q[++cnt]=(Qry){i,l1-1,l2-1,1};
  }
  sort(Q+1,Q+1+cnt); int L=0,R=0;
  for(int i=1;i<=cnt;i++){
    while(L<Q[i].a){
      L++; cur+=cr[a[L]]; cl[a[L]]++;
    }
    while(L>Q[i].a){
      cur-=cr[a[L]]; cl[a[L]]--; L--;
    }
    while(R<Q[i].b){
      R++; cur+=cl[a[R]]; cr[a[R]]++;
    }
    while(R>Q[i].b){
      cur-=cl[a[R]]; cr[a[R]]--; R--;
    }
    ans[Q[i].g]+=Q[i].c*cur;
  }
  for(int i=1;i<=m;i++)
    PutAns(ans[i]),putchar('\n');
  return 0;
}