第1关：装载问题（hncj算法）

for(int j=2; j<=n; j++)

{

r += w[j];

}

QNode *E = 0, //当前扩展节点

*bestE; //当前最优扩展节点

//搜索子集空间树

while(true)

{

//检查左儿子节点

Type wt = Ew + w[i];

if(wt <= c)//可行节点

{

if(wt>bestw)

{

bestw = wt;

}

EnQueue(Q,wt,i,n,bestw,E,bestE,bestx,true);

}

//检查右儿子节点

if(Ew+r>bestw)

{

EnQueue(Q,Ew,i,n,bestw,E,bestE,bestx,false);

}

Q.Delete(E);//取下一扩展节点

if(!E)//同层节点尾部

{

if(Q.IsEmpty())

{

break;

}

Q.Add(0); //同层节点尾部标识

Q.Delete(E); //取下一扩展节点

i++; //进入下一层

r-=w[i]; //剩余集装箱重量

}

Ew =E->weight; //新扩展节点所对应的载重量

}

//构造当前最优解

for(int j=n-1; j>0; j–)

{

bestx[j] = bestE->LChild;

bestE = bestE->parent;

}

return bestw;

}

第2关：装载问题 (最优队列法)

MaxHeap.h

#include

using namespace std;

template

class MaxHeap

{

public:

MaxHeap(int MaxHeapSize = 10);

~MaxHeap() {delete [] heap;}

int Size() const {return CurrentSize;}

T Max()

{ //查

if (CurrentSize == 0)

{

cout<<“out of bound”<<endl;

}

return heap[1];

}

MaxHeap& Insert(const T& x); //增

MaxHeap& DeleteMax(T& x); //删

void Initialize(T a[], int size, int ArraySize);

private:

int CurrentSize, MaxSize;

T *heap; // element array

};

template

MaxHeap::MaxHeap(int MaxHeapSize)

{// Max heap constructor.

MaxSize = MaxHeapSize;

heap = new T[MaxSize+1];

CurrentSize = 0;

}

template

MaxHeap& MaxHeap::Insert(const T& x)

{// Insert x into the max heap.

if (CurrentSize == MaxSize)

{

cout<<“no space!”<<endl;

return *this;

}

// 寻找新元素x的位置