文件名称:project
介绍说明－－下载内容均来自于网络，请自行研究使用
火车车厢重排问题.(一列火车要将n节车厢分别送往n个车站车站按1~n的次序编号，火车按照n, n-1,…, 1的编号次序经过车站。假设车厢的编号就是其目的地车站的编号。
要求：给定一个任意的车厢排列次序。重新排列车厢，使其按照从1到n的次序排列。规定重
)
-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)
要求：给定一个任意的车厢排列次序。重新排列车厢，使其按照从1到n的次序排列。规定重
)
-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)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
bufferstack.cpp
bufferstack.h
main.cpp
train.cpp
train.h