0 1背包问题【在线等】分支限界法01背包问题C语言

【在线等】分支限界法01背包问题C语言

哈哈,选我吧!#include #include usingnamespacestd; #defineN100 class HeapNode { public: doubleupper,price,weight; intlevel,x[N]; }; doubleMaxBound(inti); doubleKnap(); voidAddLiveNode(doubleup,doublecp,doublecw,boolch,intlevel); stackHigh; doublew[N],p[N]; doublecw,cp,c=7; intn=4; intmain() { inti; for(i=1;i>w[i]; for(i=1;i>p[i]; coutbestp)bestp=cp+p[i]; AddLiveNode(up,cp+p[i],cw+w[i],true,i+1); } up=MaxBound(i+1); if(up>=bestp) AddLiveNode(up,cp,cw,false,i+1); if(High.empty())returnbestp; HeapNodenode=(); High.pop();cw=node.weight;cp=node.price;up=node.upper; i=node.level; } }