Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems. ×

Remove Boxes

Revision en1, by wish_me, 2017-11-29 17:59:08

I need help in this problem..I tried till O(n3) complexity but not able to do...

Tags dp


  Rev. Lang. By When Δ Comment
en1 English wish_me 2017-11-29 17:59:08 151 Initial revision (published)