练习19

 

1. /******************************************************************************
2. 19. (背包问题) 有 N 件物品 d1，......dN，每件物品重量为 W1，..., WN
3.  (Wi > 0)， 每件物品价值为 V1，......VN (Vi>0)。用这N件物品的某个子集
4.  填空背包，使得所取物品的总重量<=TOTAL，并设法使得背包中物品的价值尽可
5.  能高。
7.   输入:N件物品d1....dn,每件重量为w1...wn,每件价值v1...vn;
8.   输出:N见物品的子集{di | 1 =< i <= n}
9.   过程:动态规划算法(递推)
10.   假设H[d,w]是代表含有第d件物品且总重量为w的物品总价值;得到递推式
11.   H[d,w] = 0 其中(d=0 || w=0) 表示没有物品或重量时,总价值为0
12.   H[d,w] = H[d-1,w] (w<wi)
13.   H[d,w] = max{ H[d-1,w-wi]+vi , H[d-1,w] } 其中(wi=<w<=TOTAL,d>=1)
14.  ******************************************************************************/
16. #include <stdio.h>
17. #include <malloc.h>
18. #include <stdlib.h>
19. #include <time.h>
21. static int N; // 物品的总数
22. static int TOTAL; // 物品的最大重量限制
23. static int *wi; //物品重量
24. static int *vi; //物品价值
26. //显示数据
27. void ShowData()
28. {
29.     int i;
31.     printf("               数据              /n");
32.     printf("---------------------------------/n");
33.     printf("%s%10s%10s/n","序号","重量","价值");
34.     printf("---------------------------------/n");
35.     for(i=0; i<N; i++)
36.         printf("%2d%10d%10d/n",i,wi[i],vi[i]);
37.     printf("---------------------------------/n");
38.     printf("/n");
39. }
41. //显示结果
42. void ShowResult(int **P, int **S)
43. {
44.     int d,w = TOTAL;
45.     printf("               结果              /n");
46.     printf("---------------------------------/n");
47.     printf("%s%10s%10s/n","序号","重量","价值");
48.     printf("---------------------------------/n");
49.     for(d=N; d>=1; d--)
50.     {
51.         if(S[d][w])
52.         {
53.             printf("%2d%10d%10d/n",d-1,wi[d-1],vi[d-1]);
54.         }
55.         w = P[d][w];
56.     }
57.     printf("---------------------------------/n");
58.     printf("/n");
59. }
61. void main()
62. {
63.     int i;
64.     int d,w;
65.     int **H;
66.     int **P;
67.     int **S;
69.     printf("请输入物品总数N和物品最大重量限制TOTAL:/n");
70.     scanf("%d%d",&N,&TOTAL);
72.     //申请空间
73.     wi = (int*)malloc(N*sizeof(int));//重量
74.     vi = (int*)malloc(N*sizeof(int));//价值
75.     H = (int**)malloc((N+1)*sizeof(int*));//解价值数组
76.     //..............................................
77.     P = (int**)malloc((N+1)*sizeof(int*));//保存解路径
78.     S = (int**)malloc((N+1)*sizeof(int*));//该序号的物品是否有选中
79.     //..............................................
81.     for(i=0; i<=N; i++)
82.         H[i] = (int*)malloc((TOTAL+1)*sizeof(int));
83.     //..............................................
84.     for(i=0; i<=N; i++)
85.         P[i] = (int*)malloc((TOTAL+1)*sizeof(int));
86.     for(i=0; i<=N; i++)
87.         S[i] = (int*)malloc((TOTAL+1)*sizeof(int));
88.     //...............................................
90.     srand(time(NULL));
91.     for(i=0; i<N; i++)
92.         wi[i] = rand()%(TOTAL/2)+1;
93.     for(i=0; i<N; i++)
94.         vi[i] = rand()%10+1;
95.     
96.     ShowData();
97.     //初始化
98.     for(d=0; d<=N; d++)
99.     {
100.         for(w=0; w<=TOTAL; w++)
101.         {
102.             if(d==0 || w==0)
103.                 H[d][w] = 0;
104.             else if(w<wi[d-1])
105.             {
106.                 H[d][w] = H[d-1][w];
107.                 //...........................
108.                 P[d][w] = w;
109.                 S[d][w] = 0;
110.                 //...........................
111.             }
112.             else
113.             {
114.                 H[d][w] = H[d-1][w-wi[d-1]]+vi[d-1];
115.                 //.................................
116.                 P[d][w] = w-wi[d-1];
117.                 S[d][w] = 1;
118.                 //.................................
119.                 if(H[d][w] < H[d-1][w])
120.                 {
121.                     H[d][w] = H[d-1][w];
122.                     //............................
123.                     P[d][w] = w;
124.                     S[d][w] = 0;
125.                     //............................
126.                 }
127.             }
128.         }
129.     }
130.     //显示结果
131.     ShowResult(P,S);
132.     printf("%d/n",H[d-1][w-1]);
134.     //释放空间
135.     free(wi);
136.     free(vi);
137.     for(i=0; i<=N; i++)
138.         free(H[i]);
139.     free(H);
140.     for(i=0; i<=N; i++)
141.         free(P[i]);
142.     free(P);
143.     for(i=0; i<=N; i++)
144.         free(S[i]);
145.     free(S);
147. }