银行家算法：避免死锁的并发进程管理

#include <iostream>  
using namespace std;  
#define MAXPROCESS 50                        /*最大进程数*/  
#define MAXRESOURCE 100                        /*最大资源数*/  
int AVAILABLE[MAXRESOURCE];                    /*可用资源数组*/  
int MAX[MAXPROCESS][MAXRESOURCE];            /*最大需求矩阵*/  
int ALLOCATION[MAXPROCESS][MAXRESOURCE];    /*分配矩阵*/  
int NEED[MAXPROCESS][MAXRESOURCE];            /*需求矩阵*/  
int REQUEST[MAXPROCESS][MAXRESOURCE];        /*进程需要资源数*/  
bool FINISH[MAXPROCESS];                        /*系统是否有足够的资源分配*/  
int p[MAXPROCESS];                             /*记录序列*/  
int m,n;                                    /*m个进程,n个资源*/  
void Init();  
bool Safe();  
void Bank();  
void showdata(int,int);  
int main()  
{  
    Init();  
    Safe();  
    Bank();  
}  
void Init()                /*初始化算法*/  
{  
    int i,j;  
    cout<<"请输入进程的数目:";  
    cin>>m;  
    cout<<"请输入资源的种类:";  
    cin>>n;  
    cout<<"请输入每个进程最多所需的各资源数,按照"<<m<<"x"<<n<<"矩 阵输入"<<endl;  

    for(i=0;i<m;i++)  
        for(j=0;j<n;j++)  
            cin>>MAX[i][j];  
    cout<<"请输入每个进程已分配的各资源数,也按照"<<m<<"x"<<n<<"矩 阵输入"<<endl;  
    for(i=0;i<m;i++)  
    {  
        for(j=0;j<n;j++)  
        {  
            cin>>ALLOCATION[i][j];  
            NEED[i][j]=MAX[i][j]-ALLOCATION[i][j];  
            if(NEED[i][j]<0)  
            {  
                cout<<"您输入的第"<<i+1<<"个进程所拥有的第"<<j+1<<"个资源数 错误,请重新输入:"<<endl;  
                j--;  
                continue;  
            }  
        }  
    }  
    cout<<"请输入各个资源现有的数目:"<<endl;  
    for(i=0;i<n;i++)  
    {  
        cin>>AVAILABLE[i];  
    }  
}  
void Bank()                /*银行家算法*/  
{  
    int i,cusneed,flag = 0;  
    char again;  
    while(1)  
    {