FREQUENT - Frequent values

You are given a sequence of n integers a1, a2 ... an in non-decreasing 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 ai ... aj.

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 a1 ... an (-100000 ≤ ai ≤ 100000, for each i ∈ {1 ... n}) separated by spaces. You can assume that for each i ∈ {1 ... n-1}: ai ≤ ai+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!

Added by:Adrian Kuegel
Date:2007-07-06
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:University of Ulm Local Contest 2007

hide comments
2020-06-26 09:43:06
I have realized now that java is not for competitive programming.
2020-06-15 16:03:27
non-decreasing order helps a lot!!!
2020-06-06 07:16:49
tle in java:(
2020-04-28 07:36:52
Spoj really gives me a hard time on I/O
2020-04-09 00:24:37 Mohammad Ali
using scanf literally got my solution accepted.
used scanf and cout.
2020-03-07 02:35:45
It costed me 4WA for this and a lot of time. Be careful for the last zero input.

Last edit: 2020-03-07 02:36:15
2019-12-29 21:31:34
Nice problem
2019-11-04 10:23:30
nice problem, try GSS1 after this...
2019-10-31 19:13:04
AC in one go.....After reading the comments!!
2019-07-01 01:27:21
good problem

Last edit: 2019-07-01 01:27:40
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.