FREQUENT  Frequent values
You are given a sequence of n integers a_{1} , a_{2} , ... , a_{n} in nondecreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, determine the most frequent value among the integers a_{i} , ... , a_{j}.
Input Specification
The input consists of several test cases. Each test case starts with a line containing two integers n and q (1 ≤ n, q ≤ 100000). The next line contains n integers a_{1} , ... , a_{n} (100000 ≤ a_{i} ≤ 100000, for each i ∈ {1, ..., n}) separated by spaces. You can assume that for each i ∈ {1, ..., n1}: a_{i} ≤ a_{i+1}. The following q lines contain one query each, consisting of two integers i and j (1 ≤ i ≤ j ≤ n), which indicate the boundary indices for the query.
The last test case is followed by a line containing a single 0.
Output Specification
For each query, print one line with one integer: The number of occurrences of the most frequent value within the given range.
Sample Input
10 3 1 1 1 1 1 1 3 10 10 10 2 3 1 10 5 10 0
Sample Output
1 4 3
A naive algorithm may not run in time!
hide comments
godofspeed:
20191229 21:31:34
Nice problem


fardin_abir:
20191104 10:23:30
nice problem, try GSS1 after this... 

tonystarkk:
20191031 19:13:04
AC in one go.....After reading the comments!! 

landofkings:
20190701 01:27:21
good problem Last edit: 20190701 01:27:40 

joydip007x:
20190609 14:27:42
*Segment tree size [ 4*N]


joydip007x:
20190609 14:27:00


hungbmt1503:
20190604 05:10:04
oh, forgot that this problem has multiple test case :"))


thantrongtri3:
20190530 09:51:31
Last edit: 20190530 10:53:32 

eagleshadow:
20190529 10:37:18
Nice problem!!


xxfalconxx:
20190529 08:44:43
Read the question carefully, it has multiple test cases and last test case ends with 0, Wasted so much time because of this :/ 
Added by:  Adrian Kuegel 
Date:  20070706 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  University of Ulm Local Contest 2007 