背包问题（01背包、完全背包）死记应试

背包问题（01背包、完全背包）通用公式

#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
int dp[10005]={0};
int weight[100];
int value[100];
int n,m;
cin>>n>>m;//物品个数、背包容量
for (int i=1;i<=N; i++)
{
cin>>weight[i]>>value[i];
}
for (int i=1; i<=n; i++)
for (int j=weight[i]; j<=m; j++)
{
f[j]=max(f[j],f[j-weight[i]]+value[i]);
}
cout<<dp[m]<<endl;
}

dp[0...V]<-0
for i<- 1 to n
for v <- w[i] to V
dp[v] <- max{dp[v]; dp[v − w[i]] + v[i]}
out <- dp[m]

#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
int dp[10005]={0};
int weight[100];
int value[100];
int n,m;
cin>>n>>m;//物品个数、背包容量
for (int i=1;i<=N; i++)
{
cin>>weight[i]>>value[i];
}
for (int i=1; i<=n; i++)
for (int j=m; j>=weight[i]; j--)
{
f[j]=max(f[j],f[j-weight[i]]+value[i]);
}
cout<<dp[m]<<endl;
}

dp[0...V]<-0
for i<- 1 to n
for v <- V to w[i]
dp[v] <- max{dp[v]; dp[v − w[i]] + v[i]
out <- dp[m]