ac1255.pas

这是在网络上搜集到的在东京大学的ACM上面解决的一些题目的源码

program tju1255;
const
  maxn=10000;
var
  s,t:array[1..maxn]of char;
  last:array[char]of word;
  n,i,p:longint;
begin
  repeat
    fillchar(last,sizeof(last),0);
    readln(n);
    for i:=1 to n do begin
      read(t[i]);inc(last[t[i]]);
    end;
    readln;read(p);
    for i:=1 to 255 do inc(last[chr(i)],last[chr(i-1)]);

    p:=last[pred(t[p])]+1;
    for i:=n downto 1 do begin
      s[i]:=t[p];
      p:=last[s[i]];
      dec(last[s[i]]);
    end;

    for i:=1 to n do write(s[i]);writeln;
  until seekeof;
end.