ac1140.pas

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

program tju1140;
var
  s:string;
  l,p,ans,junk:byte;
function longest(branches:byte):byte;
  var
    a,b,i,t:byte;
  begin
    inc(p);
    if s[p]='H' then begin
      longest:=0;
      exit;
    end;

    a:=0;b:=0;
    for i:=1 to branches do begin
      t:=longest(3);
      if t>a then begin
        b:=a;a:=t;
      end
      else if t>b then
        b:=t;
    end;
    if a+b+1>ans then ans:=a+b+1;
    longest:=a+1;
  end;
begin
  repeat
    readln(s);l:=length(s);
    p:=0;ans:=0;
    junk:=longest(4);
    writeln(ans);
  until seekeof;
end.