# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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?
Name |
---|