Codeforces Round #642 (Div. 3) - E. K-periodic Garland - Video Tutorial

Today I'm going to explain E from Codeforces Round #642, a task which can be solved if we reduce the problem to something similar to max subarray sum Codeforces Problem Tutorials: https://www.youtube.com/watch?v=R8DVQkRxCGg&list=PLS3KRNU_CGM7Go2ecHhN0-HBWm_6E5QLI AtCoder Problem Tutorials: https://www.youtube.com/watch?v=HIMkCkndBOU&list=PLS3KRNU_CGM5FIP9sP7tKrMYQmhmonYOi Join the Discord Server: https://discord.gg/94EJbjy Instagram: https://www.instagram.com/stef.dasca/ Codeforces: https://codeforces.com/profile/stefdasca Patreon: https://www.patreon.com/stefdasca If you liked the video, please like, subscribe and press the bell button in order to be the first ones to watch the next videos!