NOIP2006年小学组第2题pascal 找最长良序字符串

如题所述

第1个回答  2014-10-02
program liang_xu_chuan; var st,ss:ansistring; i,k,m,h:word; find:boolean; function liangxu(s:ansistring;k:word):boolean; var i,j:word; begin j:=0; for i:=1 to k-1 do begin if s[i]>=s[i+1] then begin j:=j+1; break; end; end; if j>0 then liangxu:=false else liangxu:=true; end; begin readln(st); h:=length(st); m:=h; find:=false; repeat k:=h-m+1; for i:=1 to k do begin ss:=copy(st,i,m); if liangxu(ss,m) then begin writeln(i:6,' ',ss,' ',m); writeln; find:=true; break; end; end; m:=m-1; until find; end.本回答被提问者采纳
相似回答