Discussion @ 1017. Staircases @ Timus Online Judge

Dynamic programming

Posted by VladG 27 Oct 2002 14:09

I succeed to solve it with a dynamic programming algorithm,
but the memory limits was very tough. To answer it I had to use
2 arrays: one for the first 300 rows of the array with a type of 4
bytes per number and one for the last 200 rows with a type of 8
bytes per number.

Only one array [0..500] need

Posted by Andrey Popyk (popyk@ief.tup.km.ua) 28 Oct 2002 19:51

Re: Only one array [0..500] need

Posted by SunCat 23 Nov 2002 19:26

Any details
Can you tell me how to dp?
3q

Re: Dynamic programming

Posted by cosechy 29 Aug 2004 01:37

20 rows with a type of 8 bytes per number are enough.

Discussion of Problem 1017. Staircases