Скоро Codeforces Round 1133 (Div. 1, Div. 2)! Регистрация здесь. ×

Divide and Conquer optimization

Правка en2, от topovik, 2020-03-25 10:49:01

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

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский topovik 2020-03-25 10:49:01 19 Tiny change: 'n[problem:1175G]\n\n[problem:' -> 'n[problem:'
en1 Английский topovik 2020-03-20 11:06:51 493 Initial revision (published)