文档介绍：.
#include<>#inelude<>#include<>#include<>#definemaxsize4typedefintdatatype;//顺序队列结构体的: .
#include<>#inelude<>#include<>#include<>#definemaxsize4typedefintdatatype;//顺序队列结构体的定义typedefstruct{
datatypedata[maxsize];
intfront;
intrear;}SeqQueue;//构造一个空的顺序队列SeqQueue*lnitQueue(){
SeqQueue*p;
p=(SeqQueue*)malloc(sizeof(SeqQueue));p->front=p_>rear=0;
returnp;}intnumber=0;〃缺页计数//入队intEnQueue(SeqQueue*p,datatypex){
number++;
cout<<"缺页计数"<<number<<endl;p_>data[p_>rear]=x;
p->rear=(p->rear+1)%maxsize;}〃出队voidDeQueue(SeqQueue*p){
int兀
x=p->data[p->front];
cout<<"页面"<<x<<"被淘汰！"<<endl;p->front=(p->front+1)%maxsize;}//输出顺序队列的内容voiddisplay(SeqQueue*p)
intx,s;
s=p->front;
cout<<"内存块中的页面情况为"<<endl;
while(s!=p->rear)
{x=p->data[s];cout<<x;s=(s+1)%maxsize;
}}intjustif(SeqQueue*p,datatypex){inttem,s;
s=p->front;
while(s!=p->rear){tem=p_>data[s];if(tem==x){cout<<"数已在内存块中，请输入下一个数"<<endl;