| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Search (binary/ternary) in a step function
I have a step function 'V', over a domain 't' in [0,10^7]. It has shape as shown below.
V(t) = 0 for t in [0,a),
...... = 1 for t in (a,b), and
...... = 0 for t in (b,10^7]
for some 0 <= a < b <= 10^7.
What is the best way to find a and b (i.e., the starting and ending points of V(t)=1)? Can binary/ternary search be applied in this case?
