Can someone please explain me lower_bound and upper_bound and how they are used in sorted array? Please explain in depth.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | nor | 156 |
3 | adamant | 156 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
7 | maroonrk | 153 |
7 | cry | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Can someone please explain me lower_bound and upper_bound and how they are used in sorted array? Please explain in depth.
Название |
---|
int* ptr = lower_bound(a, a + n, k);
returns the pointer to the first element in
a
that is larger than or equal to kint* ptr = upper_bound(a, a + n, k);
returns the pointer to the first element in
a
that is larger than kYou can use the following to get the index. This also means "how many elements in a are smaller than k"
int index = lower_bound(a, a + n, k) - a;
Don't forget that
std::map
andstd::set
have their ownlower_bound
andupper_bound
function.According to cplusplus.com
lower_bound(a,a+n,k)
returns pointer to the first element, where k can be inserted.upper_bound(a,a+n,k)
returns pointer to the last element, where k can be inserted :).