Should correct algo use not more than 400K?
Help need.

const
  maxnumel = 10;
  maxm = 1000;
  maxel = (100000 div maxnumel) + 1;
  good : set of char = ['A'..'Z'];

var
  stack : array[1..maxm] of integer;
  next : array[1..maxel] of integer;
  data : array[1..maxel, 1..maxnumel] of integer;
  size : array[1..maxm] of byte;
  ch : char;
  n, i, num, stacknum : integer;
  free : integer;
  st : string;

procedure readword(var st : string);
begin
  read(ch);
  st := '';
  while not(ch in good) do read(ch);
  while ch in good do begin
    st := st + ch;
    read(ch);
  end;
end;

begin
  fillchar(stack, sizeof(stack), 0);
  fillchar(size, sizeof(size), 0);
  read(n);
  free := 0;
  for i := 1 to n do begin
    readword(st);
    if st = 'PUSH' then begin
      readln(stacknum, num);

      if (size[stacknum] > 0)and(size[stacknum] < maxnumel) then begin
        inc(size[stacknum]);
        data[stack[stacknum]][size[stacknum]] := num;
      end else begin
        inc(free);
        next[free] := stack[stacknum];
        stack[stacknum] := free;
        size[stacknum] := 1;
        data[free, 1] := num;
      end;

    end else begin
      read(stacknum);
      if size[stacknum] < 1 then begin
        stack[stacknum] := next[stack[stacknum]];
        size[stacknum] := maxnumel;
      end;
      writeln(data[stack[stacknum], size[stacknum]]);
      dec(size[stacknum]);
    end;
  end;
end.

Thanks for attention!

Edited by author 02.08.2004 12:43