help pls
# | User | Rating |
---|---|---|
1 | jiangly | 3845 |
2 | tourist | 3798 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3589 |
6 | Ormlis | 3532 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | Um_nik | 3450 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | Qingyu | 159 |
3 | -is-this-fft- | 158 |
4 | atcoder_official | 157 |
5 | Dominater069 | 156 |
6 | adamant | 154 |
7 | djm03178 | 151 |
8 | luogu_official | 150 |
9 | awoo | 148 |
10 | maomao90 | 145 |
help pls
Name |
---|
Ternary search helps in such scenarios where the function is first increasing and then decreasing or first decreasing and then increasing
at linear functions the array is increase or decrease we use binary search but at quadratic function it decrease then increase or increase then decrease we use tirnary search u could see the visualization of a function at geogebra for example
Errichto's video about binary search is very helpful.
You don't binary search. Instead, you use ternary search
thank you all
you can do binary search not on the initial array (for example $$$arr$$$), but on $$$arr_i - arr_{i+1}$$$. Firstly sign of this function will be negative, then positive, so you can use binary search
use binary search and Sparse Table
Ah yes, a newbie doing binary search on Sparse Table, classic.
I doubt a normal newbie has heard of Sparse Table.
Check this out https://cp-algorithms.com/num_methods/ternary_search.html
https://oi-wiki.org/basic/binary/#%E4%B8%89%E5%88%86%E6%B3%95 This may help you.