蠻力法求解背包問題

1、/*程序說明：此程序用來解決蠻力法求解背包問題 ,運(yùn)行程序輸入背包容量和物品數(shù)量，屏幕打印運(yùn)算過程，最后運(yùn)算時(shí)間輸出到文件*/先看下運(yùn)行圖片#include /#include #include #include #include #define MAXSIZE 20000/#define BAGWEIGHT 200int aMAXSIZE = 0;int arrayMAXSIZE = 0;int weightarrayMAXSIZE = 0;/*存放各物品重量*/int valuearrayMAXSIZE = 0;/*存放各物品價(jià)值*/int lastweightMAXSIZE=0;int

2、lastvalueMAXSIZE=0;int qq=0;/*上面的數(shù)組，變量都是蠻力法所用到，下面的都是分支限界法所用到*/int BAGWEIGHT;/*背包的載重*/int n;/*物品的數(shù)量*/int weightarraybMAXSIZE = 0;int valuearraybMAXSIZE = 0;float costarraybMAXSIZE = 0;int finalbMAXSIZE = 0;int finalweightbMAXSIZE = 0;/*蠻力法 輸出窮舉的每一種可能，并求出下界*/void print()int i,xx,cc,weight,value,pp,aa;

3、weight = 0;value = 0;cc = 1;xx = 1;aa = 1;for(i = 1;i = n;i+)if(ai)printf(%3d,i);arrayxx = i;xx +;/* array=1,2,3,4*/int tempi = 0;while(xx BAGWEIGHT)printf(%-20s,str);elseprintf(%-20d,value);lastweightqq=weight;lastvalueqq=value;qq+;printf(n);for(pp = 1;pp = xx;pp+)arraypp = 0;/*檢驗(yàn)a數(shù)組，1的個(gè)數(shù)*/int jian

4、yan()int i,s = 0;for(i = 1;i n | jianyan() = k)return;at = 1;if(jianyan() = k)print();elsefun(t+1,k);at = 0;fun(t+1,k);/*從文件讀取數(shù)據(jù)*/void read()int nn = 1,ii = 1;int i = 1;FILE *fp;fp = fopen(in.dat,rb);while(!feof(fp)if(fscanf(fp,%d%d,&weightarraynn,&valuearraynn) != EOF)nn+;i+;elsebreak;fclose(fp);pr

5、intf( weight );printf(valuen);for(ii = 1;ii nn;ii+)printf(no%d: %-5d%-5d,ii,weightarrayii,valuearrayii);printf(n);/*自動(dòng)生成文件*/void become()int i;FILE *fp;fp = fopen(in.dat,w);/srand(unsigned(time(NULL);for(i=0;in;i+)fprintf(fp,%d %dn,rand()%9+1,rand()%41+10);fclose(fp);/*刪除文件*/void del()remove(in.dat)

6、;int main()printf(請輸入背包負(fù)重（大于0的整數(shù)）：);scanf(%d,&BAGWEIGHT);printf(請輸入物品數(shù)量（大于0的整數(shù)）：);scanf(%d,&n);float time_usea=0;float time_useb=0;struct timeval starta;struct timeval enda;struct timeval startb;struct timeval endb;int k = 0,i,j,u,loop;loop=0;gettimeofday(&starta,NULL);become();read();while(k != n)/

7、*蠻力法*/k+;fun(1,k);i=1;while(lastvaluei != 0)/*找到最優(yōu)解的總重量 和 總價(jià)值*/if(lastvalue0lastvaluei)j=lastvaluei;lastvaluei=lastvalue0;lastvalue0=j;u=lastweighti;lastweighti=lastweight0;lastweight0=u;i+;gettimeofday(&enda,NULL);time_usea=(enda.tv_sec-starta.tv_sec)*1000+(enda.tv_usec-starta.tv_usec)/1000;/毫秒prin

8、tf(the final weight is %dn,lastweight0);printf(the final value is %dn,lastvalue0);printf(It took you %f 毫秒n, time_usea);FILE *fp = NULL;fp = fopen(OUT.DAT, a+);if(NULL = fp) printf(wrong);return 0; fprintf(fp, 蠻力: %d %d %fn, BAGWEIGHT,n,time_usea);/fprintf(fp, 分支: %d %d %fn, BAGWEIGHT,n,time_useb/100);fclose(fp);del();/*要運(yùn)算多次，生成多次文件，所以每次算完刪除文件*/pr