题意:一个人要在自动贩卖机买可乐,给出需要可乐的数量n,以及1分钱,5分钱,10分钱的个数,一瓶可乐8分钱,如果给了10分钱会找两个1分钱,其他情况同理,自动贩卖机每次会找最少数量的硬币数,问最少投几次硬币可以买到n瓶可乐,假设钱一定足够。
题解:买一瓶可乐一共5种情况,4种找1分钱和1种找5分钱(1个10分,3个1分),因为尽可能找钱时数量少所以面额会越大,递归直到买到足够数量的可乐。
#include <stdio.h>
#include <string.h>
const int INF = 0x3f3f3f3f;
int tar, n1, n2, n3;
int f[830][105][55];
int min(int a, int b, int c, int d, int e) {
int minn = a < b ? a : b;
minn = minn < c ? minn : c;
minn = minn < d ? minn : d;
minn = minn < e ? minn : e;
return minn;
}
int dp(int n1, int n2, int n3, int t) {
if (f[n1][n2][n3] != -1)
return f[n1][n2][n3];
if (t == 0)
return 0;
int temp1 = INF, temp2 = INF, temp3 = INF, temp4 = INF, temp5 = INF;
if (n3 >= 1)
temp1 = dp(n1 + 2, n2, n3 - 1, t - 1) + 1;
if (n2 >= 2)
temp2 = dp(n1 + 2, n2 - 2, n3, t - 1) + 2;
if (n1 >= 3 && n2 >= 1)
temp3 = dp(n1 - 3, n2 - 1, n3, t - 1) + 4;
if (n1 >= 8)
temp4 = dp(n1 - 8, n2, n3, t - 1) + 8;
if (n1 >= 3 && n3 >= 1)
temp5 = dp(n1 - 3, n2 + 1, n3 - 1, t - 1) + 4;
f[n1][n2][n3] = min(temp1, temp2, temp3, temp4, temp5);
return f[n1][n2][n3];
}
int main() {
int t;
scanf("%d", &t);
memset(f, -1, sizeof(f));
while (t--) {
scanf("%d%d%d%d", &tar, &n1, &n2, &n3);
int res = dp(n1, n2, n3, tar);
printf("%d\n", res);
}
return 0;
}