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
princemishra:
20211205 07:00:51
with mos can be solved 

sal_vat_ion:
20211117 11:58:26
Read input carefully, there are multiple TCs. 

a520huynm:
20211005 17:24:18
although i create so much test case, i can't find bug. Help me ! https://ideone.com/<snip>


ravi_mhw:
20210528 14:57:07
what to do for last 0 input ,i am getting errors coz of this


ravi_mhw:
20210528 10:36:23
yes we can use squareroot decomposition and mos algorithm here


wheneveright:
20210406 04:11:56
Nice problem，Segment Tree can be used. 

yaseenmollik:
20200801 06:18:00
Same idea of maximum subarray sum problem. Nice problem. 

kushagra_2:
20200711 09:35:21
classic segtree problem try GSS1 after this


saurabh32gupta:
20200626 09:43:06
I have realized now that java is not for competitive programming. 

kamina01:
20200615 16:03:27
nondecreasing order helps a lot!!!

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 