SPOJ DQUERY 莫队 做法

DQUERY - D-query

#sorting #tree

English

Vietnamese

Given a sequence of n numbers a₁, a₂, ..., a_n and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return the number of distinct elements in the subsequence a_i, a_i+1, ..., a_j.

Input

• Line 1: n (1 ≤ n ≤ 30000).
• Line 2: n numbers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁶).
• Line 3: q (1 ≤ q ≤ 200000), the number of d-queries.
• In the next q lines, each line contains 2 numbers i, j representing a d-query (1 ≤ i ≤ j ≤ n).

Output

• For each d-query (i, j), print the number of distinct elements in the subsequence a_i, a_i+1, ..., a_j in a single line.

Example

Input
5
1 1 2 1 3
3
1 5
2 4
3 5

Output
3
2
3

原题链接

题意：给出n个数，查询m次，每次查询L~R内不同的数字的个数。

不得不说比较水，方法比较多，我初用莫队算法。

看了一些资料，对莫队算法有了一些了解。

这个算法下次好好写一篇说一说。主要就是分块的想法。

有莫队讲解了！

#include<bits/stdc++.h>
using namespace std;
const int
	N=30005,
	M=200005,
	Maxnum=1000005,
	block=174; //√30000 
int n,m,a[N];
int ans,cnt[Maxnum]; //Appear times
int Ans[M];
struct Query{
	int l,r,id;
}Q[M];
bool cmp(Query x,Query y){
	if ((x.l/block)!=(y.l/block))
		return x.l<y.l;
	return x.r<y.r;
}
inline int read(){
	int x=0,f=1;char ch=getchar();
	while (ch<'0' || ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while (ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
inline void add(int x){
	cnt[a[x]]++;
	if (cnt[a[x]]==1) ans++;
}
inline void remove(int x){
	cnt[a[x]]--;
	if (!cnt[a[x]]) ans--;
}
int main(){
	n=read();
	for (int i=0;i<n;i++)
		a[i]=read();
	m=read();
	for (int i=1;i<=m;i++)
		Q[i].l=read(),Q[i].r=read(),Q[i].id=i,
		Q[i].l--,	  Q[i].r--;
	sort(Q+1,Q+1+m,cmp);
	int L=0,R=0;ans=0;
	for (int i=1;i<=m;i++){
		while (L<Q[i].l)	remove(L++);
		while (L>Q[i].l)	add(--L);
		while (R<=Q[i].r)	add(R++);
		while (R>Q[i].r+1)	remove(--R);
		Ans[Q[i].id]=ans;
	}
	for (int i=1;i<=m;i++)
		printf("%d\n",Ans[i]);
	return 0;
}