#include?
#include?
#include?
using?namespace?std;

#define?MaxNum?20
static?int?n;//行，進(jìn)程數(shù)
static?int?m;//列，資源數(shù)
static?char?ID[MaxNum];//進(jìn)程程名
static?int?Max[MaxNum][MaxNum];//進(jìn)程所需所有資源
static?int?Allocation[MaxNum][MaxNum];//進(jìn)程已分配資源
static?int?Need[MaxNum][MaxNum];//進(jìn)程還需要資源
static?int?Available[MaxNum];////系統(tǒng)可分配資源

static?int?Request[MaxNum];//指定執(zhí)行進(jìn)程所需資源
static?int?SafeOrder[MaxNum];//安全執(zhí)行順序

void?Enter（）;//初始化，輸入進(jìn)程已分配資源、仍需資源、系統(tǒng)可分配資源，計(jì)算出進(jìn)程所需最大資源
bool?Safe（）;//判斷當(dāng)前是否安全
void?banker（）;//執(zhí)行銀行家算法，檢測執(zhí)行某一進(jìn)程后是否安全
void?display（）;//顯示結(jié)果

int?main（）{
????Enter（）;
????banker（）;
????return?0;
}

//初始化，輸入進(jìn)程已分配資源、仍需資源、系統(tǒng)可分配資源，計(jì)算出進(jìn)程所需最大資源
void?Enter（）{
????int?ij;

????cout<<“Enter?n:?“;
????cin>>n;

????cout<<“Enter?m:?“;
????cin>>m;

????//初始化進(jìn)程名
????for?（i=0;i????????ID[i]=i+65;
????}

????cout<<“Enter?Available:?“;
????for?（i=0;i????????cin>>Available[i];
????}

????cout<<“Enter?Allocation:?“<????

?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2018-02-03?16:06??實(shí)驗(yàn)三??預(yù)防進(jìn)程死鎖的銀行家算法\
?????目錄???????????0??2018-02-03?16:06??實(shí)驗(yàn)三??預(yù)防進(jìn)程死鎖的銀行家算法\AntiDeadlock\
?????文件????????6731??2017-12-16?22:00??實(shí)驗(yàn)三??預(yù)防進(jìn)程死鎖的銀行家算法\AntiDeadlock\AntiDeadlock.cpp
?????文件?????1052106??2017-12-14?11:10??實(shí)驗(yàn)三??預(yù)防進(jìn)程死鎖的銀行家算法\AntiDeadlock\AntiDeadlock.exe
?????文件????????8139??2017-12-14?11:10??實(shí)驗(yàn)三??預(yù)防進(jìn)程死鎖的銀行家算法\AntiDeadlock\AntiDeadlock.o
?????文件??????101594??2017-12-28?22:10??實(shí)驗(yàn)三??預(yù)防進(jìn)程死鎖的銀行家算法\實(shí)驗(yàn)三??預(yù)防進(jìn)程死鎖的銀行家算法.docx