Discussion @ 1113. Jeep @ Timus Online Judge

i did not anderstend this problem. Help me// PLEASE\\

Posted by Виктор Крупко 26 Apr 2005 00:50

It's not so hard

Posted by Akshin Salimov 26 Apr 2005 19:14

It's not so hard problem! This problem is classic Dynamic Programming problem, you can alg of this problem in many books(Okulov,Leyzerson,...).
DP algorithm is simple just go from the end and count with equation!

Re: It's not so hard

Posted by Виктор Крупко 26 Apr 2005 22:57

I do not understand a condition of a problem,
Instead of her decision!

Re: It's not so hard

Posted by Nirjon 14 Jul 2005 14:38

Can you explain little more plz. We donot have Okulov, Leyzerson(!). Also which Classic DP you are talking about?

Re: It's not so hard

Posted by Nirjon 17 Jul 2005 02:27

Can anyone explain how the output is 3837 for n=1000,m=500

Discussion of Problem 1113. Jeep