动态规划方程.docVIP

动态规划方程 1. 资源问题1 -----机器分配问题 //f[i][j]给i分k资源最大值 For i:=1 to n do For j:=0 to m do For k:=0 to j do If f[i-1,k]+value[i,j-k]f[i,j] then f[i,j]:=f[i-1,k]+value[I,j-k]; 2. 资源问题2 ------01背包问题 for i:=1 to num do //f[i][j]表示用i件物品装j容量的背包最大值 for j:=1 to money do F[I,j]:=max(f[i-1,j-v[i]]+w[i],f[i-1,j]); 3. 线性动态规划1 -----朴素最长非降子序列 F:=max{f[j]+1} 4. 剖分问题1 -----石子合并 F[i,j]:=min(f[i,k]+f[k+1,j]+sum[i,j]); {for i:=1 to n do for j:=i to n do for k:=i to j do s[i,j]:=s[i,j]+a[k]; for i:=1 to n do s[i,i]:=0;} For i:=n downto 1 do //f[i][j]表示i-j区间最大值 For j:=i+1 to n do //s[i][j]表示合并i-j需要的体力 For k:=i to j-1 do If f[i,j]f[i,k]+f[k+1,j]+s[i,k]+s[k+1,j] Then f[i,j]:=f[i,k]+f[k+1,j]+s[i,k]+s[k+1,j]; 5. 剖分问题2 -----多边形剖分 F[I,j]:=min(f[i,k]+f[k,j]+a[k]*a[j]*a); 6. 剖分问题3 ------乘积最大 for i:=1 to n do //f[i][j]表示i长度，添加k个乘号最大值 f[i][0]:=s[1][i]; for i:=1 to n do for j:=1 to k do if ij then for l:=1 to i-j do if f[i-l][j-1]*s[i-l+1][i]f[i][j] then f[i][j]:=f[i-l][j-1]*s[i-l+1][i]; 7. 资源问题3 -----系统可靠性(完全背包) F[i,j]:=max{f[i-1,j-c*k]*P[I,x]} 8. 贪心的动态规划1 -----快餐问题 F[i,j,k]:=max{f[i-1,j,k]+(T-(j-j)*p1-(k-k)*p2) div p3} 9. 贪心的动态规划2 -----过河 f=min{{f(i-k)} (not stone) {f(i-k)}+1} (stone); +贪心压缩状态 {for i:=1 to shi2[m]+100 do for j:=s to t do if (i-s=0)and(pd[i]) then if f[i-j]+1f[i] then f[i]:=f[i-j]+1 else else if (i-s=0) and (f[i-j]f[i]) then f[i]:=f[i-j]; } 10. 剖分问题4 -----多边形-讨论的动态规划 F[i,j]:=max{正正 f[I,k]*f[k+1,j]; 负负 g[I,k]*f[k+1,j]; 正负 g[I,k]*f[k+1,j]; 负正 f[I,k]*g[k+1,j];} g为min 11. 树型动态规划1 -----加分二叉树 (从两侧到根结点模型) F[I,j]:=max{f[I,k-1]*f[k+1,j]+c[k]} {Program Consoar; var f:array [0..100,0..100] of longint; tree:array [0..100,0..100] of longint; d:array [0..1000] of longint; i,j,k,n,l,m:longint; pr