B. JoJo's Incredible Adventures | Codeforces Round 866 (Div. 2) | Codeforces | DCC NIT-A

[@rlm3227]

This is what I was looking for!

[@DCCNITA]

♥️

[@shubhamkumar3198]

Wonderful Approach Thank you so much

[@DCCNITA]

🙌❤️

[@kabboghosh1853]

great solution

[@DCCNITA]

Thanks ❤️🙌

[@var4yn]

Damn. I had this idea, but I thought it might not work and decided to do dynamic programming that didn't pass the memory limit 😢😢

[@DCCNITA]

Sad🥲

[@ghoul_786]

Why we are dointg this ??? int e = cnt; mx = max(mx, s + e);

[@DCCNITA]

Bcz, S is count of Ones in the start of the string and E is count of Ones in the end of the string. So if you make some right shift operations then you will get that there will be a possibility in which these S+E ones will be consecutive.