- 守望者的逃离
- 2009-05-25 14:19:05 @
var
m,s,t,i,j,n:longint;
a1,a2:array [0..300000] of longint;
function max(a,b:longint):longint;
begin
if a>b then max:=a else max:=b ;
end;
begin
j:=0;
i:=0;
read (m,s,t);
n:=m div 10;
a1[0]:=60*n;
a2[0]:=60*n;
m:=m mod 10;
t :=t-n;
while i=s then n:= i;
inc(i);
if m>=10 then
begin
a1[i]:=a1+60;
m:=m-10;
end
else
begin
a1[i]:=a1;
m:=m+4;
end;
a2[i]:=max(a2+17,a1+17);
j:=max(a1[i],a2[i]);
end;
if j
0 条评论
目前还没有评论...