车厢调度5.cpp

关于数据结构

#include <stdio.H>
#include <stdlib.h>
#include <conio.h> 
typedef int SElemType;
typedef int Status; 
int end;/*最后一个车厢的号码*/
long total=0;/*总的组合方案数目*/ 

/*---------------------栈的数据结构-------------------------*/ 
typedef struct stacklist
{
     SElemType *base;
     SElemType *top;
     int stacksize;
}SqStack; 

void Stack_init(SqStack *s)
{
     s->base=(SElemType *)malloc(end*sizeof(int));
     if(!s->base) exit(0);
     s->top=s->base;
     s->stacksize=end;
} 
void Stack_Push(SqStack *s,SElemType e)
{
*(s->top)++=e;
} 
SElemType Stack_Pop(SqStack *s)
{
if(s->top==s->base)
return 0;
return *(--(s->top));
} 
Status Stack_Empty(SqStack *s)
{
if(s->top==s->base)
return 1;
return 0;
} 
Status Stack_Full(SqStack *s)
{
if(s->top-s->base==end)
return 1;
return 0;
}
void Stack_printreverse(SqStack s)
{
     int *po;
     po=s.base;
 printf("\\t[%ld]:   ",total);
 for(;po!=s.top;) 
 printf("%d ",*po++);
     printf("\\n");
}