E - Frequent values

最新推荐文章于 2024-01-27 23:04:28 发布

翔蝈蝈

最新推荐文章于 2024-01-27 23:04:28 发布

阅读量200

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构__练习文章标签： each query integer input 64bit output

本文链接：https://blog.youkuaiyun.com/q573290534/article/details/6667198

数据结构__练习专栏收录该内容

26 篇文章

订阅专栏

这是一个关于处理序列查询的问题，输入包含多个测试用例，每个用例包含一个非递减顺序的整数序列和一系列查询。对于每个查询，需要找出在给定范围内的整数中最常出现的值。输出为每个查询中指定区间内最频繁出现的数值的出现次数。

Time Limit: 2000MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

[Submit] [Go Back] [Status]

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

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₁ , ... , a_n (-100000 ≤ a_i ≤ 100000, for each i ∈ {1, ..., n}) separated by spaces. You can assume that for each i ∈ {1, ..., n-1}: 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

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