Hi for everyone.

At this blog I want to offer you some tasks on D&C optimization.

About this algorithm you can learn here.

When you can use this and other DP optimizations you can learn at this blog.

Some tasks on D&C optimization.

834D - The Bakery

673E - Levels and Regions

321E - Ciel and Gondolas

868F - Yet Another Minimization Problem

Hey. In this post I`d like to give some tasks on centroid decomposition.

There`re useful links below

https://neerc.ifmo.ru/wiki/index.php?title=Centroid_decomposition

https://mirror.codeforces.com/blog/entry/73707

Also some tasks on this topic

293E - Close Vertices

321C - Ciel the Commander

342E - Xenia and Tree

914E - Palindromes in a Tree

960E - Alternating Tree

990G - GCD Counting

1156D - 0-1-Tree

776F - Sherlock's bet to Moriarty

716E - Digit Tree

348E - Pilgrims

150E - Freezing with Style

Hey. In this post I want to give some tasks on convex hull trick. There are some useful posts about CHT below. https://mirror.codeforces.com/blog/entry/63823

https://neerc.ifmo.ru/wiki/index.php?title=Convex_hull_trick

There are some task on this topic

1083E - The Fair Nut and Rectangles

1303G - Sum of Prefix Sums

1175G - Yet Another Partiton Problem

932F - Escape Through Leaf

792F - Mages and Monsters