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
cj23897: 2017-05-21 06:49:53

Be aware people.
The limit of n is less than 3*10^5 not 30000

deepak_k1414: 2017-04-29 13:13:04

anyone solved it using segment tree

shailesh_24: 2017-04-12 22:59:47

my first MO's problem..got AC....

jeelapamy: 2017-04-11 15:38:07

DONT EVEN THINK OF cin and cout

shubham: 2017-04-11 13:34:40

BIT , OFFLINE QUERY , SORTING

szawinis: 2017-03-31 06:48:25

Not need for MO. Just fenwick tree is enough.

psiphon_exe: 2017-03-23 11:56:47

Made with simple logic without any algorithm

gkcs: 2017-03-16 05:37:12

Hi All!
I picked this problem up for explaining Mo's algorithm at work. Here is a video tutorial on the same:
https://youtu.be/hqaRYgsLpUI
Cheers!

evenpeng_91: 2017-03-12 08:55:58

Does anyone get AC using Golang?

ruben_ash: 2017-03-10 19:07:53

MOooOOO0000ooo0O0O0

Last edit: 2017-03-10 19:14:49

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