In-depth editorial for 811C

Revision en1, by Ollie, 2017-05-29 23:40:11

I did the round #416 as a virtual contest but I didn't quite manage to solve problem C during the time frame. It took me a while but eventually I realized how the O(n^2) DP solution for it works so I thought I'd write a breakdown of the problem for anyone who tried to code it and failed.

The example code is in C++11 but it's mostly just images and text. Hopefully it helps someone!

https://cpfd.ghost.io/codeforces-811-c/

Tags dynamic programming, 811c, div2, prefix

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Ollie 2017-07-02 23:15:31 57
en1 English Ollie 2017-05-29 23:40:11 459 Initial revision (published)