Cherish的博客

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 &.

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].