|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87 |
//参考书上的算法#include <iostream>#define N 12#define V 100using
namespace
std;typedef
struct
box{int
id;int
boxsize;struct
box* next;}BOX;void
initboxlist(BOX ** H){ *H=(BOX*)malloc(sizeof(BOX)); (*H)->id=0; (*H)->boxsize=0; (*H)->next=NULL;}BOX* findbox(BOX* H,int
vl,int
v){ BOX* p=H; while(p != NULL) { if(p->boxsize+vl<=v) break; p=p->next; } return
p;}void
addlisttail(BOX* H,BOX* p){ BOX* q=H; BOX* tmp=H->next; while(tmp!=NULL) { q=tmp; tmp=tmp->next; } q->next=p;}void
printlist(BOX* H){ BOX* p=H; while(p!=NULL) { cout<<p->id+1<<" "<<p->boxsize<<endl; p=p->next; }}void
addbox(int
vol[],int
v){ BOX* H=NULL; int
boxcount=0; initboxlist(&H); for(int
i=0;i<N;i++) { BOX *p=findbox(H,vol[i],v); if(p==NULL) { BOX *t=(BOX*)malloc(sizeof(BOX)); boxcount++; t->id=boxcount; t->boxsize=vol[i]; t->next=NULL; addlisttail(H,t); } else p->boxsize+=vol[i]; } printlist(H);}int
main(){ int
vol[]={60, 45, 35, 20, 20, 20,55,87,65,76,67,100}; addbox(vol,V);} |
原文：http://www.cnblogs.com/newhcw/p/3525615.html