Here's the usual shameless self-advertisement!

Talking with my colleagues a few months ago, I noticed that except for the editorial of Aliens (IOI 2016), there isn't any comprehensive resource in learning the DP optimization (well, maybe except for this one, but... yeah), so I decided to write a more extensive tutorial on it. Cheers! ^^

Here's some more shameless self-advertising!

It's been quite a while since my last blog post as I've been focusing on the IOI selection in Romania, but soon that will be all over so I hope I'll have the time to write some more.

The article is about one of the nicest CP problems I've encountered so far, found while looking through the archives of the Romanian international competitions selection camp. Hope you'll enjoy it! :)

Here's a bit of shameless self-advertising!

I created my own website instead of posting directly on codeforces because I find it much more flexible and adapted for the other articles I intend to write (sorry for the trouble). I have another almost finished article on abstract algebra in competitive programming (mostly number theoretical applications of group theory and some interesting theoretical CS aspects) and I mention it hoping someone will keep nagging me to finish it, as it lays almost done for almost four months.

Also, about this article specifically, you may skip the throwback to the FFT paragraph as it doesn't have much to do with the rest of the article, but reveal some interesting linear algebraic things related to "the classical FFT" and shows the almost ubiquity of Kroneker products in linear transform related convolutions. Just keep in mind that you need to know what the Kroneker product is.

Feel free to ask questions, make suggestions or tell me I'm stupid! :)

Note: I'd like to thank Pascal Sommer and pleasant for helping me correct some grammar and small calculation mistakes.