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

bankerremain_a+=processes[p]a;

bankerremain_b+=processes[p]b;

bankerremain_c+=processes[p]c;

for(i=p;i

processes[i]=processes[i+1];

}

strcpy(processes[quantity-1].name,"");

processes[quantity-1].a=0;

processes[quantity-1].b=0;

processes[quantity-1].c=0;

processes[quantity-1].need_a=0;

processes[quantity-1].need_b=0;

processes[quantity-1].need_c=0;

quantity--;

cout<<"撤消作业成功"<

}

else{

cout<<"撤消作业失败"<

}

}

//查看资源情况

void view()

{

int i;

cout<

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