You are given an array of size n find number of distinct digits in the numbers in a given range ? I know how to do it with segment tree , please help me to do it with Binary indexed tree .
thanks in advance :)
№ | Пользователь | Рейтинг |
---|---|---|
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 | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
You are given an array of size n find number of distinct digits in the numbers in a given range ? I know how to do it with segment tree , please help me to do it with Binary indexed tree .
thanks in advance :)
I know how to do it with Segment tree but How to calculate range minimum query using Binary Indexed Tree.
thanks in advance!!
Given N points in the 2- D plane , find minimum radius of the circle which encloses atleast m points?
thanks in advance
Any number can be expressed as the sum of squares of four numbers according to lagrange four square theorem, i want to find all possible solution for the given number, I know a algorithm which work in O(n*root(n)), is their any more optimized algorithm ?
thanks in advance :)
-----------------
I request codeforces to organise contest on regular basis, the last 3-4 contest were organised in a rapid way, but now after those contest the next contest is after 5 days, So i request codeforces to organise contest regularly.
please MikeMirzayanov have a look over it and Thanks for the Codeforces and Polygon systems.
Thankyou
Название |
---|