i am using upperbound and lowerbound in c++ regularly but i don't know actual algorithm behind this??? Plzz help..
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3312 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/25/2026 04:38:31 (h1).
Desktop version, switch to mobile version.
Supported by
It's a simple binary search.
http://www.cplusplus.com/reference/algorithm/upper_bound/
Actually i m not able to understand this step. std::advance (it,step);
bcoz this step is linear and this will increase it's complexity..?
its just equal to it+step in our case, works for O(1)
It's O ( 1 ) when you have random access iterators, on non random access iterators it has linear complexity.
http://www.cplusplus.com/reference/algorithm/lower_bound/