十大题型算法全实现——（九）银行家算法[2]

int a;

int b;

int c;

int remain_a;

int remain_b;

int remain_c;

}bank;

typedef struct node{

char name[];

int a;

int b;

int c;

int need_a;

int need_b;

int need_c;

}process;

bank banker;

process processes[MAX_P];

int quantity;

//初始化函数

void initial()

{

int i;

bankera=MAXA;

bankerb=MAXB;

bankerc=MAXC;

bankerremain_a=MAXA;

bankerremain_b=MAXB;

bankerremain_c=MAXC;

for(i=;i

[1] [2] [3] [4] [5] [6] [7] [8] [9] [10]