记录编号	1294	评测结果	AAAAAAAAAA
题目名称	[IOI 1994] 数塔	最终得分	100
用户昵称	打不死的羊	是否通过	通过
代码语言	Pascal	运行时间	10.000 s
提交时间	2008-09-01 20:26:25	内存使用	0.00 MiB

program shuta;
Type
fxz1=array[1..80,1..80] of longint;
Var
f1,f2:text;
i,j,k,n:longint;
num1,num2,way:fxz1;
 procedure work(i:longint);
 var
 j:longint;
 begin
 for j:=1 to i do
 if num1[i+1,j]>=num1[i+1,j+1]
 then begin num1[i,j]:=num1[i,j]+num1[i+1,j];
            way[i,j]:=j;end
 else begin num1[i,j]:=num1[i,j]+num1[i+1,j+1];
            way[i,j]:=j+1;end;
 end;
begin
assign(f1,'shuta.in');
assign(f2,'shuta.out');
reset(f1);rewrite(f2);
readln(f1,n);
for i:=1 to n do
 begin
 for j:=1 to i do
 read(f1,num1[i,j]);
 readln(f1);
 end;
num2:=num1;
for i:=n-1 downto 1 do work(i);
writeln(f2,num1[1,1]);
write(f2,num2[1,1]);k:=1;
for i:=1 to n-1 do
begin
write(f2,num2[i+1,way[i,k]],' ');
k:=way[i,k];
end;
close(f1);close(f2);
end.