选课-树形动态规划.pptVIP

选课;分析;样例分析;动态规划;构造树结构;procedure work(now:longint);inline; var i,j,k,bas:longint; begin for i:=1 to t[now] do work(ne[now,i]); bas:=ts[now-1]+1; for i:=bas+1 to bas+t[now] do {f[i,j]表示i子树内选j的最大价值} for j:=1 to m do begin {g[i,j]是给每个节点分配的内部背包的空间} g[i,j]:=g[i-1,j]; {i不选} for k:=1 to j do {i选k门} if g[i-1,j-k]+f[ne[now,i-bas],k]g[i,j] then begin g[i,j]:=g[i-1,j-k]+f[ne[now,i-bas],k]; fa[i,j]:=k;{记录决策点} end; end; for i:=m downto 1 do{计算f[i,j]} f[now,i]:=g[t[now]+bas,i-1]+v[now]; end;;进一步分析;转化为二叉树;动态规划;样例求解过程：初始f(i,0)=0 f(6,1)=6, f(5,1)=max{1,6}=6, f(7,1)=2 f(4,1)=max{1,2}=2, f(1,1)=max{1,f(4,1)}=2 f(3,1)=4, f(2,1)=max{1,4}=4 f(5,2)=7 f(7,2)=max{f(5,1)+2}=8 f(4,2)=max{f(7,2),f(7,1)+1}=8 f(1,2)=max{f(4,2),f(4,1)+2}=8 f(2,2)=max{f(1,1)+1, f(3,1)+1)}=5 f(7,3)=9 f(4,3)=max{f(7,2)+1,f(7,3)}=9 f(1,3)=max{f(4,2)+1,f(4,3)}=9 f(2,3)=max{f(1,1)+f(3,1)+1,f(1,2)+1}=9 f(2,4)=max{f(1,3)+1, f(1,2)+f(3,1)+1}=max{9+1,8+4+1}=13 ;//读入数据 ,转化为孩子兄弟表示 fin n m; score[n+1] = 0; brother[n+1] = 0; // 输入数据并转化为左儿子右兄弟表示法 for (int i=1; i=n; ++i) { int a, b; fin a b; if (a == 0) a = n + 1; score[i] = b; brother[i] = child[a]; child[a] = i; };void dfs( int i, int j) { if (visited[i][j]) return; visited[i][j] = 1; if (i==0 || j==0) return; dfs(brother[i], j); // 如果不选i，则转移到状态(brother[i], j) f[i][j] = f[brother[i]][j]; for (int k=0; kj; ++k) { // 选择i，枚举学习多少以i为根的 (j-k-1)，并转移到相应状态 dfs(brother[i], k); dfs(child[i], j-k-1); // 更新答案 if (f[brother[i]][k] + f[child[i]][j-k-1] + score[i] f[i][j]) f[i][j] = f[brother[i]][k] + f[child[i]][j-k-1] + score[i]; } }