背包DP入门笔记（5）最少的硬币 POJ-3260

3260 -- 最少的硬币 (poj.org)

思路： 此题是一个混合背包问题，买家为多重背包，卖家为混合背包。

重点：

1：明确背包上限                120*120+10000           

  解析来源于：POJ 3260 The Fewest Coins 题解《挑战程序设计竞赛》-码农场 (hankcs.com)

2：多重背包进行二进制拆分求解

3：找到硬币数的一定是最小值

DP状态转移方程：

1：多重背包时                dp[k] = min(dp[k], dp[k - c[i] * v[i]] + c[i])

2：完全背包时                dp1[j] = min(dp1[j], dp1[j - v[i]] + 1)               

#include<iostream>
#define maxsize 30000
#define inf 0x3f3f3f3f
using namespace std;

int dp[30000] = { 0 };
int dp1[30000] = { 0 };
void solve(int n, int t);
int max(int i, int j);
int min(int i, int j);

int main() {
	int n, t;
	scanf_s("%d %d", &n, &t);
	solve(n, t);
	return 0;
}

void solve(int n, int t) {
	int v[105] = { 0 }, c[105] = { 0 };
	int sum = 0;
	for (int i = 1; i <= n; i++) {
		scanf_s("%d", &v[i]);
	}
	for (int i = 1; i <= n; i++) {
		scanf_s("%d", &c[i]);
		sum += c[i];
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n - 1; j++) {
			if (v[j] < v[j + 1]) {
				int v1 = v[j], c1 = c[j];
				v[j] = v[j + 1], c[j] = c[j + 1];
				v[j + 1] = v1, c[j + 1] = c1;
			}
		}
	}
	memset(dp, inf, sizeof(int) * 30000);
	memset(dp1, inf, sizeof(int) * 30000);
	dp[0] = dp1[0] = 0;
	for (int i = 1; i <= n; i++) {		/*多重背包求最小钱币数*/
		for (int j = 1; j < c[i]; j<<=1) {
			for (int k = maxsize; k >= j * v[i]; k--) {
				dp[k] = min(dp[k], dp[k - j * v[i]] + j);
			}
			c[i] -= j;
		}
		for (int k = maxsize; k >= c[i] * v[i]; k--) {
			dp[k] = min(dp[k], dp[k - c[i] * v[i]] + c[i]);
		}
	}
	int m=inf;
	if (dp[t] != inf) {
		m = dp[t];
	}
	for (int i = 1; i <= n; i++) {		/*完全背包求最小钱币数*/
		for (int j = v[i]; j <= maxsize-t; j++) {
			dp1[j] = min(dp1[j], dp1[j - v[i]] + 1);
		}
	}
	for (int i = 1; i <= maxsize-t; i++) {
		if (dp[i + t] != inf && dp1[i] != inf&& dp[i + t]+ dp1[i]<m) {
			m = dp[i + t] + dp1[i];
		}
	}
	if (m == inf) {
		cout << -1 << endl;
	}
	else {
		cout << m << endl;
	}
	return;
}

int max(int i, int j) {
	return (i > j) ? i : j;
}

int min(int i, int j) {
	return(i < j) ? i : j;
}