题目链接:http://poj.org/problem?id=3260
题意:有一个人去买m元的东西,有n种钱币,没种钱币的面额是v[i],个数是c[i],售货员每种钱币有无数多个。现在这个人想让交易的钱个数最少,即找回的和付出钱的张数最少
思路:可以给出证明,背包容量的上界是maxv * maxv + m,因为当买家付款超过这个值时,那么对方找回的钱必然不小于maxv * maxv,再由鸽笼原理可知必然硬币总额相加时起码有两个数对maxv取模相等,那么这个差值的钱币在买家付款时便没必要给出。
买家的方案可看做多重背包,售货员方案看做完全背包,找一下即可。
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
const int maxn = 125;
const int maxm = maxn * maxn + 10000;
const int inf = 0x3f3f3f3f;
int v[maxn], c[maxn];
int dp1[maxm], dp2[maxm];
int main()
{
int n, t;
while (~scanf("%d%d", &n, &t))
{
int maxv = 0;
for (int i = 0; i < n; i++)
{
scanf("%d", &v[i]);
maxv = max(maxv, v[i]);
}
for (int i = 0; i < n; i++)
scanf("%d", &c[i]);
maxv = maxv * maxv + t;
memset(dp1, inf, sizeof(dp1));
memset(dp2, inf, sizeof(dp2));
dp1[0] = dp2[0] = 0;
for (int i = 0; i < n; i++)
for (int j = v[i]; j < maxv; j++)
dp1[j] = min(dp1[j], dp1[j - v[i]] + 1);
for (int i = 0; i < n; i++)
{
int num = c[i];
for (int k = 1; num > 0; k <<= 1)
{
int mul = min(k, num);
for (int j = maxv; j >= v[i] * mul; j--)
{
dp2[j] = min(dp2[j], dp2[j - v[i] * mul] + mul);
}
num -= mul;
}
}
int ans = inf;
for (int i = t; i < maxv; i++)
{
ans = min(ans, dp2[i] + dp1[i - t]);
}
if (ans == inf)
printf("-1\n");
else
printf("%d\n", ans);
}
return 0;
}