http://www.programmersheaven.com/ Contains the latest posts from the thread 'Dynamic programming problem - optimal route time' posted on the 'Algorithms' forum at Programmer's Heaven. en Copyright 2013 Programmers Heaven Fri, 24 May 2013 23:54:43 -0700 Fri, 24 May 2013 23:54:43 -0700 Argotic Syndication Framework 2007.3.0.1, http://www.codeplex.com/Argotic http://www.rssboard.org/rss-specification 360 http://www.programmersheaven.com/images/ph.gif http://www.programmersheaven.com/ 88 31 http://www.programmersheaven.com/mb/Algorithms/428471/428471/dynamic-programming-problem---optimal-route-time/ Hello,<br /> <br /> I have following problem to solve:<br /> Please take a look at the photo:<br /> <a href="http://www.voila.pl/401/ctbd9/?1"></a><br /> <br /> Input:<br /> 4 - number of stations<br /> 3 - number of changes between stations<br /> 15 3 2 10 7 - time of traveling betwen bus station<br /> 2 25 30 1 10 - time of traveling betwen railway station<br /> 7 10 5 1 - time to travel from bust station to railwey station<br /> 10 8 5 5 - time to travel form railwey station to bus station<br /> <br /> Output:<br /> 33<br /> <br /> <br /> I need to solve the problem using dynamic programming.<br /> I write some code in ansi C that works properly but for input files with number of stations larger than 100 the algorithm becoming very very slov. How to solve the task properly? Any Tips?<br /> <br /> <br /> Paul<br /> <br /> <br /> http://www.programmersheaven.com/mb/Algorithms/428471/428471/dynamic-programming-problem---optimal-route-time/ Thu, 17 May 2012 09:33:26 -0700 Algorithms