以栈模拟停车场，以队列模拟车场外的便道，按照从终端读入的输入数据序列进行模拟管理。每一组输入数据包括三个数据项：汽车“到达”或“离去”信息、汽车牌照号码以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或便道上的停车位置；若是车辆离去，则输出汽车在停车场内停留的时间和应交纳的费用（在便道上停留的时间不收费）。栈以顺序结构实现，队列以链表结构实现。-Stack mimics the parking to the queue simulation car off the sidewalk, in accordance with the sequence of input data read from the terminal management simulation. Each set of input data includes three data items: car " arrival"　or " departure"　information, vehicle license number and the time of arrival or leave. After each set of input data, output information: If the vehicle arrives, the output of the location of car parking in the car park or on the sidewalk　stay car in the parking lot of time and should pay If the vehicle is left, the output the cost (no charge) stay on the sidewalk. The stack sequential structure, queues, linked list structure.