Hi Codeforces, i 'm confusing between learning convex hull trick and li chao tree. Can everyone suggest which should i learn first or should i just need to learn line container by heart withou understanding? I heard that li chao can't solve problems with numerous line or deal with big num but line container can! Thanks in advance :D
Auto comment: topic has been updated by thaonguyendethuongvai (previous revision, new revision, compare).
I would suggest learning all three of them as they are crucial for reaching specialist. \s
i just need some thing to optimize some dp problems generally
Are you a clown? To become an expert, you need DP, binary search and some graphs. You DON'T need any advanced techniques.
That's not true, convex hull and Li Chao is a necessity for expert. You probably got lucky.
Man, i have got expert twice without these awful data structures.
You fall back down every time because you don't know Li Chao and convex hull.
You think that you know everything about me, but in fact, I know the Li Chao tree, convex hull trick and dynamic convex hull trick. And I don't recommend learning these structures, because I already know them.
Make up your mind. Either way, you can't reach expert without Li Chao tree and Convex Hull and Dominator trees and Matroid intersection and Fibonacci heaps unless you get very lucky.
lichao tree is basically a data structure that returns values needed for CHT, as of minimums/maximums point on the set of lines, it complements cht so i guess learn that first?
I would suggest learning them both. XD
thanks you XD
go with li chao, he sounds like he knows what he's talking about
Auto comment: topic has been updated by thaonguyendethuongvai (previous revision, new revision, compare).
lên spec đi rồi tính nhóc con
nhóc con mẹ mày
oc pupil
oc expert
avatar m nhìn giống phò thế