以栈模拟停车场，以队列模拟车场外的便道，按照从终端读入数据的序列进行模拟管理。每一组输入数据包括三个数据项：汽车的“到达”（‘A’表示）或“离去”（‘D’表示）信息、汽车标识（牌照号）以及到达或离去的时刻。对每一组输入数据进行操作后的输出信息为：若是车辆到达，则输出汽车在停车场内或者便道上的停车位置；若是车辆离去，则输出汽车在停车场停留的时间和应缴纳的费用（便道上停留的时间不收费）。栈以顺序结构实现，队列以链表结构实现。-Parking in the stack simulation to simulate the queue sidewalk outside the car, according to the data read from the terminal sequence simulation management. Each set of input data consists of three data items: car " arrive"　(' A'　represents) or " left"　(' D'　indicates) information, auto identification (license number), and the time of arrival or departure. Output information for each set of input data after the operation as follows: If the vehicle arrives, the output car in the parking lot or on a sidewalk parking position　If the vehicle leave the car in the parking lot output residence time and should be paid costs (time spent on the sidewalk of charge). Stack structure in order to achieve the queue list structure to achieve.