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.
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 | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
2 | awoo | 163 |
4 | TheScrasse | 157 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
Название |
---|
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/