jzoj4314 老司机

Description

Input

Output

Sample Input

4
1 3 6 6

Sample Output

3
1 2 3

Data Constraint

算法讨论

因为cost<=50，所以k不会超过6，暴力即可。

var
  a,q:array[0..100] of longint;
  c:array[0..100] of boolean;
  n,i,j,e,r,k,t,p,aa,bb,cc,min:longint;
procedure xh(o:longint);
var
  w:longint;
begin
  for w:=50-o downto 0 do
    if c[w] then c[w+o]:=true;
end;
function check:boolean;
var
  w:longint;
begin
  fillchar(c,sizeof(c),false);
  c[0]:=true;
  xh(i);xh(e);xh(k);
  xh(j);xh(r);xh(t);
  for w:=1 to n do
    if not c[a[w]] then exit(false);
  exit(true);
end;
begin
  assign(input,'driver.in');reset(input);
  assign(output,'driver.out');rewrite(output);
  readln(n);
  min:=maxlongint;
  for i:=1 to n do
    read(a[i]);
  for i:=0 to 1 do
    for j:=0 to 2 do
      for k:=0 to 4 do
        for e:=0 to 10 do
          for r:=0 to 16 do
            for t:=00 to 32 do
              if check then
                begin
                  p:=0;
                  if i<>0 then inc(p);
                  if j<>0 then inc(p);
                  if k<>0 then inc(p);
                  if e<>0 then inc(p);
                  if r<>0 then inc(p);
                  if t<>0 then inc(p);
                  if p>=min then continue;
                  min:=p;
                  q[1]:=i;q[2]:=j;q[3]:=k;
                  q[4]:=e;q[5]:=r;q[6]:=t;
                  for aa:=1 to 5 do
                    for bb:=aa+1 to 6 do
                      if q[aa]>q[bb] then
                        begin cc:=q[aa];q[aa]:=q[bb];q[bb]:=cc;end;
                end;
  writeln(min);
  for aa:=1 to 6 do
    if q[aa]<>0 then write(q[aa],' ');
  close(input);close(output);
end.