Frequent values-------最多的连续的个数

Frequent values

Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 58   Accepted Submission(s) : 22

Problem Description

You are given a sequence of n integers a₁ , a₂ , ... , a_n 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 a_i , ... , a_j.

 

Input

<p>The input consists of several test cases. Each test case starts with a line containing two integers <strong>n</strong> and <stro