Ollie's blog

In-depth editorial for 811C
By Ollie, history, 7 years ago, In English

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://competitive-programming-for-dummies.quora.com/In-depth-Codeforces-811C

  • Vote: I like it
  • +22
  • Vote: I do not like it

»
7 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Dear Ollie,

I became a big fan of yours because of the way you explained this problem in your blog post, plz keep up the good work..

→ Reply
»
7 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Link died :(

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This is a really good problem indeed xD

→ Reply