传送门
本人正式意义上第一道莫队(差不多也是第一道分块)。由于水平有限,概括为两点:
1.离线处理,将区间排序,双指针扫描
2.按权值分块,块内整块统计,块外(两端)
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+4,MAXM=1e6+4;
int n,m,siz;
int bel[MAXN],blk[MAXN],num[MAXN],cnt[MAXN],ans[MAXM];
struct Q {
int l,r,a,b,id;
friend bool operator <(const Q &x,const Q &y) {
return bel[x.l]==bel[y.l]?x.r<y.r:x.l<y.l;
}
}q[MAXM];
inline void add(int x) {++cnt[x];if (cnt[x]==1) ++blk[bel[x]];}
inline void del(int x) {--cnt[x];if (cnt[x]==0) --blk[bel[x]];}
inline int query(int l,int r) {
int ret=0;
if (bel[l]==bel[r]) {
for (int i=l;i<=r;++i) ret+=(bool)cnt[i];
return ret;
}
for (int i=bel[l]+1;i<bel[r];++i) ret+=blk[i];
for (int i=(bel[l]+1)*siz-1;i>=l;--i) ret+=(bool)cnt[i];
for (int i=bel[r]*siz;i<=r;++i) ret+=(bool)cnt[i];
return ret;
}
inline int read() {
int x=0;char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x;
}
int main() {
// freopen("bzoj 3809.in","r",stdin);
n=read(),m=read(),siz=(int)sqrt(double(n));
for (register int i=1;i<=n;++i) num[i]=read(),bel[i]=i/siz;
for (register int i=1;i<=m;++i) q[i].l=read(),q[i].r=read(),q[i].a=read(),q[i].b=read(),q[i].id=i;
sort(q+1,q+m+1);
int l=1,r=0;
for (register int i=1;i<=m;++i) {
while (l>q[i].l) add(num[--l]);
while (r<q[i].r) add(num[++r]);
while (l<q[i].l) del(num[l++]);
while (r>q[i].r) del(num[r--]);
ans[q[i].id]=query(q[i].a,q[i].b);
}
for (register int i=1;i<=m;++i) printf("%d\n",ans[i]);
return 0;
}