停车场管理系统.doc

。源程序清单 #include stdafx.h#include#include#include #include#define MAX 3 /停车场中D最?多停MAX辆车#define price 0.05 /按分钟收费#define NULL 0typedef struct Timeint hour;int minute;Time;typedef struct CarNodechar num10;Time reach;Time leave;CarNode;typedef struct NodeCarNode *stackMAX+1;int top;SeqStackCar;typedef struct carCarNode *data;struct car *next;QueueNode;typedef struct QNodeQueueNode *head;QueueNode *rear;LinkQueueCar;void InitStack(SeqStackCar*); /构造栈int InitQueue(LinkQueueCar*); /构造队列int Reach(SeqStackCar*, LinkQueueCar*); /解决车辆到达事件void Leave(SeqStackCar*, SeqStackCar*, LinkQueueCar*); /解决车辆离开事件void PRINT(CarNode*, int room); /打印需要缴纳的费用void List1(SeqStackCar*); /显示停车场内信息void List2(LinkQueueCar*); /显示便道内信息void List(SeqStackCar,LinkQueueCar); /显示车辆列表void ReachTime(CarNode*); /到达时间函数void InitStack(SeqStackCar*S)int i;S-top=0;for(i=0;istacki=NULL;int InitQueue(LinkQueueCar*Q)Q-head=(QueueNode*)malloc(sizeof(QueueNode);if(Q-head!=NULL)Q-head-next=NULL;Q-rear=Q-head;return 1;elsereturn -1;void PRINT(CarNode *p,int room)int A1,A2,B1,B2;printf(n请输入车辆离开的时间（小时，分钟）（例：12，23）：);scanf_s(%d,%d,&(p-leave.hour),&(p-leave.minute);if(p-leave.hourleave.hour23)printf(您的输入有误！);printf(请重新输入离开时间的时(023）：);scanf_s(%d,&(p-leave.hour);if(p-leave.minuteleave.minute59)printf(您的输入有误！);printf(请重新输入离开时间的分（059）：);scanf_s(%d,&(p-leave.minute);printf(n离开车辆的车牌号为：);puts(p-num);printf(该车到达的时间为：%d:%dn, p-reach.hour, p-reach.minute);printf(该车离开的时间为：%d:%dn, p-leave.hour, p-leave.minute);A1 = p-reach.hour;A2 = p-reach.minute;B1 = p-leave.hour;B2 = p-leave.minute;printf(应缴纳的费用为a：%2.1f元,(B1-A1)*6