#include "iostream.h"
#include "malloc.h"

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2

typedef struct LNode
{
	struct date{
		char *name;//訂票姓名
		int dnum;//訂票數(shù)量
		int dj;//證件編號(hào)
		float pay;//付費(fèi)
	    }data;//數(shù)據(jù)域
	struct LNode *next;//指針域
	int n1;//座位號(hào)計(jì)數(shù)
}LNode,*LinkList;//構(gòu)造單鏈表
int InitList_L(LinkList &L)
{
	L=new LNode;
	L->n1=1;//L->next->data.dj=0;
	L->next=NULL;
	return OK;
}//初始化單鏈表

typedef int Status;
struct ElemType{
	char *endname;//終點(diǎn)站名
	char *hnum;//車次名
	int  fnum;//票價(jià)
	float  discut;
	int day;//日期
	int wholenum;//總票額
    	int lastnum;//余票量
	LinkList la;//已訂票鏈表
	LinkList lb;//排隊(duì)名單鏈表
};//構(gòu)造結(jié)構(gòu)類型

struct ElemType Tab[16]={"北京","b1",158,82,1,100,5,NULL,NULL,
	"上海","s1",143,64,1,100,100,NULL,NULL,
	"南京","n1",137,75,1,100,2,NULL,NULL,
	"徐州","x1",180,58,1,100,100,NULL,NULL,
	"北京","b2",172,90,2,100,100,NULL,NULL,
	"上海","s2",118,82,2,100,100,NULL,NULL,
	"南京","n2",130,76,2,100,100,NULL,NULL,
	"徐州","x2",263,38,2,100,100,NULL,NULL,
	"北京","b3",160,75,3,100,100,NULL,NULL,
	"上海","s3",187,14,3,100,100,NULL,NULL,
	"南京","n3",132,64,3,100,100,NULL,NULL,
	"徐州","x3",185,84,3,100,100,NULL,NULL,
	"北京","b4",136,73,4,100,5,NULL,NULL,
	"上海","s4",189,83,4,100,100,NULL,NULL,
	"南京","n4",170,57,4,100,100,NULL,NULL,
	"徐州","x4",155,68,4,100,100,NULL,NULL};//初始化結(jié)構(gòu)類型數(shù)組

#define LIST_INIT_SIZE 1000
#define LISTINCREMENT 10

typedef struct{
	struct ElemType *elem;
	int len;
	int listsize;
}SqList;//構(gòu)造順序表

Status InitList_Sq(SqList &L) 
{
   // 構(gòu)造一個(gè)空的線性表L
   L.elem = new ElemType[LIST_INIT_SIZE];
   if (!L.elem) return OVERFLOW; // 存儲(chǔ)分配失敗
   L.len = 0;			// 長度為0
   L.listsize = LIST_INIT_SIZE; // 初始存儲(chǔ)容量
   return OK;
} // InitList_Sq初始化順序表

SqList Create_Sq(SqList &L)
{
	L.len=16;
	for(int i=0;i<L.len;i++)
	{
	L.elem[i]=Tab[i];
	InitList_L(L.elem[i].la);
	InitList_L(L.elem[i].lb);
}
	return L;
}//創(chuàng)建順序表