Discussion @ 1264. Workdays @ Timus Online Judge

Posted by Tiberiu Florea 11 Apr 2004 04:21

is this dynamic programming ? :)
or maybe we could try a nice branch and bound ! ;)

Re: dp

Posted by 107th 23 Mar 2007 16:18

Yes!!

Re: dp

Posted by Rustam 26 Apr 2008 17:25

it's not a dp! this problem is much simpler than you think!
answer is n*(m+1).
who wants to get explanation, email me rganeyev at gmail.com

Re: dp

Posted by Armen Tsirunyan 4 Dec 2008 02:00

Oh Really???!!! Isn't it DP?! WOW! BUT HOW?!!! Oh please please DO tell me, how on earth can this extremely sophisticated problem be solved without DP! I read your formula, but I can't understand it. Oh please help.
:))))

Re: dp

Posted by Nikita Artyushov (SPb SU, mat-meh) 27 Oct 2009 02:11

)))

Re: dp

Posted by Ignas 8 Aug 2011 22:29

After many WA I finally got AC. That was one tough problem :D

Discussion of Problem 1264. Workdays