1. We have moved from vBulletin to XenForo and you are viewing the site in the middle of the move. Though the functional aspect of everything is working fine, we are still working on other changes including the new design on Xenforo.
    Dismiss Notice

Please help me!

Discussion in 'C' started by Chaster, Dec 8, 2006.

  1. Chaster

    Chaster New Member

    Joined:
    Dec 8, 2006
    Messages:
    3
    Likes Received:
    0
    Trophy Points:
    0
    Hi, everyone!
    I have th following problem:There are n cars on a rail track, numbered with distinct values from the set {1, 2, . . . , n}. A crane available at that location may pick k cars from the rail track and place them at the end of the sequence of cars (imagine this as being on the right hand side). Then, this cars are pushed to form a continuous line of cars.
    Given the initial order of the cars, you are required to find (if possible) the minimum number of operations which the crane must execute to get the cars in sorted order,
    i.e 1, 2, . . . , n.
    Remark: this problem should be resolved using the Branch and Bound algorithm.

    Any help would be appreciated. Thanks in advance.
     
  2. Aztec

    Aztec New Member

    Joined:
    May 9, 2006
    Messages:
    90
    Likes Received:
    0
    Trophy Points:
    0
    Do you really think people will solve it for you?
    Show some efforts first.
     
  3. Chaster

    Chaster New Member

    Joined:
    Dec 8, 2006
    Messages:
    3
    Likes Received:
    0
    Trophy Points:
    0
    I'm just asking for some ideas.
    P.S. Please don't post anything if you don't wanna help me. Thanks
     

Share This Page