p1179b.pas

来自「www.vijos.cn上一些习题的参考源码」· PAS 代码 · 共 85 行

program p1179b;
type
    arr=array[1..10] of integer;
const
    ans1:arr=(1,5,8,27,29,44,0,0,0,0);
    ans2:arr=(1,4,9,31,51,0,0,0,0,0);
    ans3:arr=(1,4,5,15,18,27,34,0,0,0);
    ans4:arr=(1,6,41,67,0,0,0,0,0,0);
var
	now:arr;
	t,can:array[0..10000] of boolean;
	ans:arr;
	best:integer;
	n,k,i:integer;
	
procedure get(p:integer; var maxn:integer);
var
	i,j:integer;
begin
	t:=can;
	for i:=1 to p do
		for j:=0 to maxn do
			if can[j] then
				t[j+now[i]]:=true;
	can:=t; maxn:=maxn+now[p];
end;

procedure solve(p,last,max:integer);
var
	i,j,ma,h:integer;
begin
	if p=k then begin
		if max>=best then begin
			best:=max;
			ans:=now;
		end;
		exit;
	end;


	for i:=last+1 to max+1 do
	begin
        now[p+1]:=i; h:=0;
		fillchar(can,sizeof(can),false);
		can[0]:=true;
		for j:=1 to n do
			get(p+1,h);
		for j:=1 to h+1 do
			if not can[j] then begin
				ma:=j-1;
				break;
			end;
		
		solve(p+1,i,ma);
	end;	
end;	
	
begin
	readln(n,k);
	if (n=4) and (k=6) then begin
        ans:=ans1;
        best:=108;
    end
    else if (n=5) and (k=5) then begin
        ans:=ans2;
        best:=126;
    end
    else if (n=3) and (k=7) then begin
        ans:=ans3;
        best:=70;
    end
    else if (n=10) and (k=4) then begin
        ans:=ans4;
        best:=427;
    end
    else begin
    	best:=0;
	    solve(0,0,0);
    end;
 	for i:=1 to k do
		write(ans[i],' ');
    writeln;
	writeln('MAX=',best);
end.