流水作业调度（动态规划）－算法设计与分析

//流水作业调度
const int maxn=5;
int a[]={2,4,3,6,1};
int b[]={5,2,3,1,7};
int c[maxn];
struct node
{
    int key,id;
    bool job;
};
int cmp(const node &a,const node &b)
{
    return a.key<=b.key;
}
int flow_shop()
{
    int j=0,k=maxn-1,n=maxn;
    node *d=new node[n];
    for(int i=0;i