|
|
вернуться в форумПоказать все сообщения Спрятать все сообщения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! I do not understand a condition of a problem, Instead of her decision! Can you explain little more plz. We donot have Okulov, Leyzerson(!). Also which Classic DP you are talking about? Can anyone explain how the output is 3837 for n=1000,m=500 |
|
|