回帖：type arr=array[1..100] of 0..1;
var d,w:array[1..100] of integer;
n,c,i,t:longint;
min:longint;
bb:arr;
input,output:text;
procedure search(bp,t,wt,fx:integer;bb:arr);
var i,j,tl,tr:longint;
wl,wr:longint;
b:arr;
begin
for i:=1 to n do b:=bb;
if fx=1 then
begin
i:=bp+1; wr:=wt; tr:=t+d-d;
while b=0 do
begin
i:=i+1; tr:=tr+d-d
end;
wr:=wr+tr*w; b:=0;
if wr>=min then exit
else
if (i1) and (wr1 then
begin
search(i,tl,wl,1,b);
search(i,tl,wl,-1,b);
end
else
begin
j:=1;
while (j