| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 161 |
| 2 | maomao90 | 160 |
| 3 | awoo | 159 |
| 4 | atcoder_official | 157 |
| 5 | -is-this-fft- | 155 |
| 5 | nor | 155 |
| 5 | adamant | 155 |
| 8 | maroonrk | 152 |
| 8 | Um_nik | 152 |
| 10 | Petr | 146 |
Number of distinct elements in a range in an array(solving online)
hello everyone,
Recently i came across this problem http://www.spoj.com/problems/DQUERY/en/. I solved the problem using Mo's algo and BST which is basically offline solution. Is there a way I can solve for each query online? If yes, please help me out.
Thanks in advance!!
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en2 |
|
Code_sprinter | 2020-06-11 07:49:33 | 91 | ||
| en1 |
|
Code_sprinter | 2020-06-11 07:47:22 | 344 | Initial revision (published) |
