Divide and Conquer optimization
Difference between en1 and en2, changed 19 character(s)
Hi for everyone.↵
↵
At this blog I want to offer you some tasks on D&C optimization.↵
↵
About this algorithm you can learn [here](https://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html).↵
↵
When you can use this and other DP optimizations you can learn at [this](https://codeforces.net/blog/entry/8219?locale=ru) blog.↵
↵
Some tasks on D&C optimization.↵
↵
[problem:834D]↵
↵
[problem:673E]↵
↵
[problem:321E]↵
↵
[problem:1175G]↵
↵
[problem:868F]

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English topovik 2020-03-25 10:49:01 19 Tiny change: 'n[problem:1175G]\n\n[problem:' -> 'n[problem:'
en1 English topovik 2020-03-20 11:06:51 493 Initial revision (published)