DQUERY - D-query


Given a sequence of n numbers a1, a2, ..., an 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 ai, ai+1, ..., aj.

Input

  • Line 1: n (1 ≤ n ≤ 30000).
  • Line 2: n numbers a1, a2, ..., an (1 ≤ ai ≤ 106).
  • 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 ai, ai+1, ..., aj in a single line.

Example

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

Output
3
2
3 

hide comments
kevin: 2018-11-22 10:38:32

The problem statement is wrong. Please fix it.
If I set the range of n to 30001, it gives me wrong answer, but it gives me correct answer if I set the range of n to 300001, it's accepted.

[---------see notes below---------https://id--ne.com/**********--------]
Try this code with editing maxn to 30001 and 300001

Last edit: 2018-11-22 13:37:58
arvindj97: 2018-11-09 09:36:07

Getting tle while using java with fenwick tree

Pls suggest any suitable java code.

davitmarg: 2018-11-07 14:47:01

AC in 14 mo

alexandro5432: 2018-10-26 20:43:37

offline BIT+very fast io+inline functions+many optimisations=AC
I am coding in c++ but I think TL is very strict.

Last edit: 2018-10-26 20:44:25
skirim06: 2018-09-29 00:27:56

MO's + fast io + cpp = AC
MO's + fast io + java = TLE

dipankar12: 2018-09-23 12:13:32

java+mo getting TLE. Anyone solved using JAVA and mo?

Last edit: 2018-09-23 12:13:50
redcenturion: 2018-09-18 08:17:59

Can we solve this by segment tree ?

lax_99: 2018-08-31 08:26:07

If you're using MO's algorithm, make sure you use array instead of vector and array of frequencies instead of Hash Table.

bharat133: 2018-08-10 10:47:31

Last edit: 2018-08-10 10:48:11
sdeven_0245: 2018-08-04 20:17:39

Mo works fine but not the fenwick gives TLE for me..

Last edit: 2018-08-15 18:32:18

Added by:Duc
Date:2008-10-26
Time limit:0.227s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:© VNOI