左兒子右兄弟法？？不錯(cuò)  回復(fù)  更多評(píng)論
  

LZ有沒hdu 1561的代碼 學(xué)習(xí)下  回復(fù)  更多評(píng)論
  

@TT
1561 的代碼我有，但是不知道如何判斷-1的情況：
var
n,m,i:longint;
fa,w:array [1..200] of longint;
f:array [0..200,0..200] of longint;
procedure dfs(h,s:longint);
var
i,j:longint;
begin
if s<=0 then exit;
for i:=1 to n do
if fa[i]=h then begin
for j:=0 to s-1{cost[child]} do f[i,j]:=f[h,j];
dfs(i,s-1{cost[child]});
for j:=1{cost[child]} to s do
if f[h,j]<f[i,j-1]+w[i] then
f[h,j]:=f[i,j-1]+w[i];
end;
end;
begin
repeat
readln(n,m);
if not ((n=0)and(m=0)) then begin
for i:=1 to n do readln(fa[i],w[i]);
dfs(0,m-0);
writeln(f[0,m-0]);
end;
until (n=0)and(m=0);
end.  回復(fù)  更多評(píng)論