7
Codeforces Round #861 (Div. 2) – O(log N) solution for E + full video editorial
source link: http://codeforces.com/blog/entry/114540
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Codeforces Round #861 (Div. 2) – O(log N) solution for E + full video editorial
Hello, I've made a full video editorial for the latest CF round. I'm a bit late, but I can compensate that by having a super-solution for problem E, which is faster than the authors' and also easier in my opinion.
https://www.youtube.com/watch?v=i1i_7lqnGwA
Thanks to all the authors for a cool contest!
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK