ac1122.pas

同济大学 Online在线题库 AC源代码合集 程序设计竞赛必看资料

program tju1122;
const
  maxn=20;
var
  len:array[0..maxn]of word;
  n,t,m,l,i,j,ans,x,max:word;
begin
  repeat
    read(n,t,m);m:=m*t;ans:=0;max:=0;
    for i:=1 to n do begin
      read(l);if l<=t then begin
        inc(max);len[max]:=maxlongint;
        for j:=max downto 1 do begin
          if t-len[j-1] mod t<l then x:=(len[j-1] div t+1)*t+l else x:=len[j-1]+l;
          if x<len[j] then len[j]:=x;
          if (len[j]<=m) and (j>ans) then ans:=j;
        end;
      end;
    end;
    writeln(ans);
  until seekeof;
end.