![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
咖啡不加糖有点甜
星辰大海
展开
-
背包问题
01背包 状态转移方程:dp[i][j]=max(dp[i−1][j],dp[i−1][j−w[i]]+v[i])∣∣dp[i−1][j]dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i])||dp[i-1][j]dp[i][j]=max(dp[i−1][j],dp[i−1][j−w[i]]+v[i])∣∣dp[i−1][j] for (int i = 1; i <= n; i++) { for (int j = 0; j &.原创 2020-07-24 11:50:58 · 107 阅读 · 0 评论 -
动态规划入门(数字三角形)
package dp; import java.util.Scanner; public class MaxContinueArraySum { public static void main(String[] args) { Scanner scanner=new Scanner(System.in); int r=scanner.nextInt(); int [][]a=new int [r+2][r+2]; int [][]dp=new int [r+2][r+2].原创 2020-05-27 14:55:12 · 139 阅读 · 0 评论