| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 157 |
| 4 | maroonrk | 154 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | TheScrasse | 145 |
| 9 | nor | 145 |
Given an array A of n elements and queries of type (l r k),find the number of occurrences of k in the range l to r
If there are no updates, we can solve the problem by having a map<int,vector> and doing a binary search.
But what if there are updates involved.
I read somewhere that we can use bit..
But I am not sure how that would be useful
Thank you in advance
Auto comment: topic has been updated by arshad2117 (previous revision, new revision, compare).
You can use SQRT decomposition. Time complexity is O(q*sqrt(n)*lg(n)+n*lg(n)).
You can also do it offline and compress the numbers in queries, and the time complexity would be O(q*sqrt(n)+n).
Can you please elaborate or provide some relevant link?
I don't have any links, let's wait for the others to respond.
Never mind,got it thanks!!!
Batman please explain how to compress numbers in queries. this is new for me.
Now you can use lower_bound(b,b+new_n,x) to find where x is.
You can use de merge sorte tree, that is, a segmente tree where each node is a sorted vector(from l to r), the in each query you just do a lower bound an a upper bound. https://discuss.codechef.com/questions/94448/merge-sort-tree-tutorial
Thanks
You can do update and query in
, using map<int, Tree>, where Tree is Treap/AVL/Red-black/... tree.