为什么只有75分

var a,gg,cc:array[1..10000] of integer;  
    i,j,k,max:longint;  
begin  
  k:=0;  
  while not eoln do  
  begin  
    inc(k);  
    read(a[k]);  
    gg[k]:=1;  
  end;  
  fillchar(cc,sizeof(cc),0);  
  inc(cc[gg[k]]);  
  for i:=k-1 downto 1 do  
  begin  
    max:=0;  
    for j:=i+1 to k do  
    if (a[i]>=a[j]) and (max<gg[j]+1) then max:=gg[j]+1;  
    if max<>0 then gg[i]:=max;  
    inc(cc[gg[i]]);  
  end;  
  max:=0;  
  for i:=k downto 1 do  
  if gg[i]>max then max:=gg[i];  
  writeln(max);  
  max:=0;  
  for i:=1 to k do  
  if cc[i]>max then max:=cc[i];  
  write(max);  
end.