ac1270.pas

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

program tju1270;
const
  maxn=10000;
var
  f:array[1..maxn]of longint;
  n,i,l,x,ans:longint;
begin
  repeat
    read(n);ans:=0;
    for i:=1 to n do begin
      read(l,l);f[i]:=0;
      repeat
        read(x);if x=0 then break;
        if f[x]>f[i] then f[i]:=f[x];
      until false;
      inc(f[i],l);
      if f[i]>ans then ans:=f[i];
    end;
    writeln(ans);
  until seekeof;
end.