装箱问题
问题地址:http://codevs.cn/problem/1014/
类似于采药问题的01背包,给一个定容的容器往里面塞东西求最多能塞多少东西,简化为第i个塞或者不塞的问题
(好久没做题啦,01背包几乎全忘啦,翻了一片不错的博文,地址:http://blog.csdn.net/mu399/article/details/7722810)
#include<iostream>
#include<algorithm>
using namespace std;
int a[31][20001] = { 0 };//数组有些大开在主函数里面无法运行
int main()
{
int b[31] = { 0 };
int v, n;
cin >> v >> n;
for (int i = 0; i < n; i++)
{
cin >> b[i + 1];
}
for (int i = 1; i <=n; i++)
{
for (int j = 1; j <= v; j++)
if (j>=b[i])
{
a[i][j] = max(a[i - 1][j], a[i - 1][j - b[i]] + b[i]);//状态方程
}
else
a[i][j] = a[i - 1][j];
}
cout << v-a[n][v]<<endl;
return 0;
}