数据结构课设电梯模拟——绝对原版,给我好评啊（Data structure class elevator simulation - the absolute original, to my praise!）.docVIP

数据结构课设电梯模拟——绝对原版,给我好评啊（Data structure class elevator simulation - the absolute original, to my praise!） /*10, elevator simulation (5) See the exercises section of the exercise book, P102 2.8 Added: lift load Weight, WasteTime per pass (30t) Man: randomly generated, assuming that every definite period of time (N seconds) is randomly generated (N seconds after another is also random), in which his various states are also randomly generated. Elevator: as in reality: when it is on the rise, the elevator does not go to the person who goes down the floor Algorithm idea: the stack in the elevator is allowed to jump the queue (to go to the same layer of people together), the queue is also able to jump the queue (to go to the same layer of people are also together), Deal with the incoming and outgoing condition of each layer, and deal with the person waiting on each floor once. If he has been impatient, send it out. * / #includestdio.h #includestdlib.h #include map.h #define ElemType Personp #define, Height, 5//, floor height //#define Weight 15// elevator maximum load bearing #define T 0.1// analog clock unit (1 stands for 0.1 seconds) Double rectime = 0; Typedef struct { Int num; / / mark the name of the person Int now; / / the current floor Int des; Double patience; / / maximum waiting time (from the elevator door to enter the elevator) }Person, *Personp; #define open 20*T// the time it takes to lift the elevator #define, close, 20*T//, the time needed for the elevators #define search 40*T// scans each time to see if someone has passed the elevator #define speed 30*T// The time required for #define walk 25*T// to pass the elevator #define wait 300*T// elevator waiting time, beyond this limit, go back to the first floor #define per 100*T// randomly generates one person every other period of time ////////////////////////////////////////////////////////// / / stack (the first element is empty) Typedef struct node { ElemType date; Struct node *next; }SNode, *Stackp; / / stack