tyvj/tyvj1209.pas

   1 var
   2 n,i,j,max:longint;
   3 a,f:array [0..1000] of longint;
   4 ch:char;
   5
   6 begin
   7    n:=1;
   8    while not eoln do
   9    begin
  10       read(ch);
  11       if ch<>',' then a[n]:=a[n]*10+ord(ch)-ord('0') else inc(n);
  12    end;
  13   max:=1; for i:=1 to n do f[i]:=1;
  14    for i:=1 to n do
  15      for j:=i-1 downto 1 do
  16        if a[j]>a[i] then
  17          begin
  18               if f[i]<f[j]+1 then f[i]:=f[j]+1;
  19               if f[i]>max then max:=f[i];
  20          end;
  21    write(max,',');
  22    for i:=1 to n do f[i]:=1; max:=1;
  23     for i:=1 to n do
  24        for j:=i-1 downto 1 do
  25         if a[j]<a[i] then
  26          begin
  27               if f[i]<f[j]+1 then f[i]:=f[j]+1;
  28               if f[i]>max then max:=f[i];
  29          end;
  30    writeln(max-1);
  31 end.