Given n numbers and m queries for each query (L R) find the most frequent number from L to R and how many times it occurs in this interval
for example:
input:
7 3
3 5 3 5 5 3 3
2 4
3 3
1 3
output:
5 2
3 1
3 2
thanks in advance.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Given n numbers and m queries for each query (L R) find the most frequent number from L to R and how many times it occurs in this interval
for example:
input:
7 3
3 5 3 5 5 3 3
2 4
3 3
1 3
output:
5 2
3 1
3 2
thanks in advance.
Название |
---|
Link
thanks :)
Hi! Please write the link of problem statement. I couldn't find that. Thanks
I think it can be solved by Treap or segment tree.
At each node we will save answer for current segment.
UPD: Wrong
Imagine we know answers for [l, mid) and [mid, r).
How to combine these answers and find it for [l, r)?
You can use MO's algorithm to solve, you can find detailed explanation here : http://blog.anudeep2011.com/mos-algorithm/