还是选与不选的问题, 数据范围这么小,DFS一下就可以了
背包思想: 题目要求出最大的装载量,每个物品的重量为它的价值, 所以这就是一个裸的01背包了啦啦啦啦
搜索
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5+10;
int v, n;
int w[MAXN];
int xx = 0, maxx = 0;
void dfs(int x) {
if(xx > v)
return;
if(x == n) {
maxx = max(xx, maxx);
return;
}
xx += w[x];
dfs(x+1);
xx -= w[x];
dfs(x+1);
return;
}
int main(int argc, char const *argv[])
{
cin >> v >> n;
for(int i = 0; i < n; i++)
cin >> w[i];
dfs(0);
cout << v-maxx << endl;
return 0;
}
背包
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5+10;
int v, n;
int w[MAXN];
int xx = 0, maxx = 0;
void dfs(int x) {
if(xx > v)
return;
if(x == n) {
maxx = max(xx, maxx);
return;
}
xx += w[x];
dfs(x+1);
xx -= w[x];
dfs(x+1);
return;
}
int dp[MAXN];
int main(int argc, char const *argv[])
{
cin >> v >> n;
for(int i = 1; i <= n; i++)
cin >> w[i];
for(int i = 1; i <= n; i++) {
for(int j = v; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j-w[i]]+w[i]);
}
cout << v-dp[v] << endl;
return 0;
}