Re: Confusing Algorithm

2013-04-23 Thread Tim Roberts
RBotha wrote: > >I'm facing the following problem: > >""" >In a city of towerblocks, Spiderman can >“cover” all the towers by connecting the >first tower with a spider-thread to the top >of a later tower and then to a next tower >and then to yet another tower until he >reaches the end of the

Re: Confusing Algorithm

2013-04-22 Thread Ian Kelly
On Mon, Apr 22, 2013 at 2:33 PM, Christian Gollwitzer wrote: > I'd agree with your interpretation. "Threads are straight lines and cannot > intersect towers" - I read it such that the answer is the "convex hull" of > the set of points given by the tower height. The convex hull can be computed > fo

Re: Confusing Algorithm

2013-04-22 Thread DJC
On 22/04/13 13:39, RBotha wrote: I'm facing the following problem: """ In a city of towerblocks, Spiderman can “cover” all the towers by connecting the first tower with a spider-thread to the top of a later tower and then to a next tower and then to yet another tower until he reaches the end of

Re: Confusing Algorithm

2013-04-22 Thread Christian Gollwitzer
Am 22.04.13 16:57, schrieb Oscar Benjamin: On 22 April 2013 13:56, Chris Angelico wrote: On Mon, Apr 22, 2013 at 10:39 PM, RBotha wrote: Threads are straight lines and cannot intersect towers. Your task is to write a program that finds the minimal number of threads to cover all the towers.

Re: Confusing Algorithm

2013-04-22 Thread Oscar Benjamin
On 22 April 2013 13:56, Chris Angelico wrote: > On Mon, Apr 22, 2013 at 10:39 PM, RBotha wrote: >> I'm facing the following problem: >> >> """ >> In a city of towerblocks, Spiderman can >> “cover” all the towers by connecting the >> first tower with a spider-thread to the top >> of a later tower

Re: Confusing Algorithm

2013-04-22 Thread Chris Angelico
On Tue, Apr 23, 2013 at 12:57 AM, Oscar Benjamin wrote: > On 22 April 2013 13:56, Chris Angelico wrote: >> There are other possible readings of the problem. > > I read it differently. I thought the threads would go 1->5->7->5->2. I hadn't thought of that one, but agreed, that's also plausible, a

Re: Confusing Algorithm

2013-04-22 Thread Chris Angelico
On Mon, Apr 22, 2013 at 10:39 PM, RBotha wrote: > I'm facing the following problem: > > """ > In a city of towerblocks, Spiderman can > “cover” all the towers by connecting the > first tower with a spider-thread to the top > of a later tower and then to a next tower > and then to yet another tower