Description: Train cars rearrangement problem. Question: a Train To n cars were sent to the n stations Station 1 ~ n the order number, the train in accordance with the n, n-1, ..., number order through the station. Suppose compartment number is the number of the destination station. Requirements: given an arbitrary compartment Ranking. Rearrange the carriages, so arranged in the order from 1 to n. Provisions the rearrangement only from the orbit to the buffer rails or tracks from the buffer to the derailment. Restrictions: an orbit, a derailment, the the k strips buffering rails (1 ≤ k ≤ n-1)
To Search:
File list (Check if you may need any files):
bufferstack.cpp
bufferstack.h
main.cpp
train.cpp
train.h
Download