第二章 所用來源程式 [Queue隊列的定義]

#ifndef QUEUE_H_#define QUEUE_H_#include <iostream>#include<vector>#include<math.h>using namespace std;#define MAXSIZE 500000static int n_r;static int n_time;static long double s_all=0;static long double sum=0;const double PI=3.14;const int NS=100;const int NT=1000;static vector <struct QueueElementType> detector;struct QueueElementType{long double x;long double y;long double r;};struct SeqQueue{QueueElementType element[MAXSIZE];int front;int rear;};inline void InitQueue(SeqQueue *Q){Q->front=Q->rear=0;}inline bool EnQueue(SeqQueue *Q,QueueElementType x){if((Q->rear+1)%MAXSIZE==Q->front){cout<<"out"<<endl;return false;}Q->element[Q->rear]=x;Q->rear=(Q->rear+1)%MAXSIZE;return true;}inline bool DeQueue(SeqQueue *Q,QueueElementType *x){if(Q->front==Q->rear)return false;*x=Q->element[Q->front];Q->front=(Q->front+1)%MAXSIZE;return true;}inline void  GetHead(SeqQueue *Q,QueueElementType *x){*x=Q->element[Q->front];}struct square_A{longdouble x;longdouble y;int z;};static QueueElementType self[NS];static square_A test[NT];static long double rs,r0;static SeqQueue Q;static  SeqQueue *p1;#endif