pascal程序设计高手请进!!

来源:百度知道 编辑:UC知道 时间:2024/05/10 20:22:38
NOIP马上就要到了,我还有几个算法不懂,谁能教教我广搜和堆排,谢谢了,必有重赏!!
我将在得到好的回答后追加100分的悬赏

var a:array[1..3,1..1000]of longint;
b:array[1..3]of longint;
c:array[0..20]of longint;
d:array[1..20]of longint;
n,i,j,t,qian,hou,k1,k2,k3,pan:longint;
begin
assign(input,'milk.in');
reset(input);
assign(output,'milk.out');
rewrite(output);
read(b[1],b[2],b[3]);
a[3,1]:=b[3];
qian:=1;
hou:=1;
repeat
for i:=1 to 6 do
begin
if i=1 then if (a[1,qian]<>0)and(a[2,qian]<>b[2]) then
begin
t:=a[1,qian]+a[2,qian];
if t<b[2] then begin k2:=t;k1:=0;k3:=a[3,qian]end
else begin
k2:=b[2];
k1:=t-b[2];
k3:=a[3,qian];
end;