BLKJK - Editorial

anon10218360 · January 17, 2021, 5:15pm

Could you please elaborate a bit(no pun intended) about your approach? Thanks!

Oleg · January 17, 2021, 8:12pm

Turned out we don’t even need state optimization to pass.
svatejas@, I left comments for this submission. CodeChef: Practical coding for everyone
Enjoy.

rohanrtd9 · January 18, 2021, 6:00am

Thank you so much

infinite_king · March 2, 2021, 11:10am

@naveenls , Really a great observation . I was trying to understand the editorial for a long time and finally saw this post. Thanks for sharing your approach. Now i will try to code this solution.

jeffinbiju · June 28, 2021, 12:25pm

Can you explain as to how you’re doing this final part i.e finding min(max(…) ) in ny time complexity? I tried using a segment tree but that takes ny*log(y) time and I’m getting TLE.