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!

hide comments
swag33r: 2014-01-15 22:22:08

@srijan http://www.spoj.com/submit/FREQUENT/id=10798389 wat the prob with my code i got runtime error

Last edit: 2014-01-15 22:22:53
harsh: 2014-01-14 18:45:01

feels gr8 after nailing this one..:)..

samfisher: 2013-12-22 21:13:24

how to break ties ?

Last edit: 2013-12-22 21:13:34
$я_ʍ±ℓ๏ : 2013-08-28 20:01:33

wat is the use 0...if we already know the no. of queries..*_________*

Pranye Mawai: 2013-08-20 06:17:10

tle :(

codesprout: 2013-05-30 09:27:16

Can someone please post more test cases?

Mykhaylo Medvedev: 2012-12-20 10:13:03

it contains multiple test cases - don't forget

Ziklon: 2012-09-20 04:19:36

one killer case ?


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