Discussion @ 1145. Rope in the Labyrinth @ Timus Online Judge

Chen Tsung Can this be done with O(N) memory ? [2] // Problem 1145. Rope in the Labyrinth 17 Jul 2005 17:33

Can this be done with O(N) memory ?

Nephtali Garrido Re: Can this be done with O(N) memory ? [1] // Problem 1145. Rope in the Labyrinth 24 Jul 2005 10:57

Maybe if your friend explain us his method....

http://acm.timus.ru/forum/thread.aspx?id=10059

if somebody has a method to solve it will be so useful.

Thanks

Eustas Re: Can this be done with O(N) memory ? // Problem 1145. Rope in the Labyrinth 21 Aug 2008 17:20

Possibly yes. But in O(N^3) time which is inacceptible.

Edited by author 07.09.2008 21:52

Discussion of Problem 1145. Rope in the Labyrinth