Why ternary search fails for Div2c Today.
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
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 | 151 |
Why ternary search fails for Div2c Today.
Название |
---|
Mine didn't.
Yours is binary search
No? I found the lowest value by ternary search and then did lower bound on original array.
its binary search.
Finding the minimum of the parabola doesn't guarantee that the line won't intersect with it.
why can't we just find k that is closest to b through binary search?
We need (b-k)^2 -4ac to be <0
So, we need to find the value of k closest to b. If this doesn't satisfy <0 condition then rest values will never satisfy. Am I missing something? Handle SHARANTEJAREDDY
you are correct, I just shared my approach from what I remembered from JEE quadratic equations :).