关于动态规划的详细讲解在→这里
//DP问题 板子
//背包问题
//1,正向、逆向循环i
void dp()
{
for(int i = 0; i < n; i ++)
{
for(int j = 0; j <= W; j ++)
{
if(j+w[i]<=W)
{
dp[i+1][j] = max(dp[i][j],dp[i][j-w[i]]+v[i]);//i逆向循环则dp[i][j] = max(dp[i+1][j],dp[i+1][j-w[i]]+v[i])
}
else
dp[i+1][j] = dp[i][j];//i逆向循环则dp[i][j] = dp[i+1][j]
}
}
}
//2
void dp()
{
for(int i = 0; i < n; i++)
{
for(int j = 0; j <= W; j ++)
{
dp[i+1][j] = max(dp[i][j],dp[i+1][j]);
if(j+w[i] <= W)
dp[i+1][j+w[i]] = max(dp[i+1][j+w[i]],dp[i][j]+v[i]);
}
}
}