NOI China 1999 : Birthday Cake

Revision en1, by pranet, 2016-03-06 14:46:41

http://wcipeg.com/problem/noi99p3

Could someone please help with this problem? Best I could come up with was a (n^2.5) *m dp solution which will obviously timeout.

Found this blog online, but couldn't understand the idea (search + pruning). https://www.byvoid.com/blog/noi-1999-solution

Thanks!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English pranet 2016-03-06 14:46:41 340 Initial revision (published)