Hello codeforces!

I recently came across the topic of dp optimization (Knuta-Yao, Lambda, Convex Hull Trick, divide and conquer), and it seemed to me that it often appeared at the olympiads in my region. However, I practically did not find a task on this topic (I do not deny the fact that I searched badly). So, if someone has links to problems on this topic or search method for such problems and you don't mind sharing them, I will be very grateful to you!

EDIT: Besides, it can help others with what I think is an all-powerful topic.