题意:有N种面值的硬币,最多用K枚硬币能组成1~M的金额,求M
解题思路:
- 用values[i] = j代表第i种面值的硬币面值为j,最大的面值为max_value。用f[i] = j代表组成金额为i最少需要j枚硬币。
- 初始化f[0] = 0, f[1...max_value+1] = K+1
- DP过程:f[i] = min(f[i - values[j]]) + 1,其中j = [0, N-1],并且i - values[j] >= 0。
- 最后遍历一遍f[i],找到第一个大于K的值对应的i,输出i -1即可
代码:
/*
ID: zc.rene1
LANG: C
PROG: stamps
*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(void)
{
FILE *fin, *fout;
int K, N;
int values[50], max_value = -1;
int *f = NULL;
int i, j, min;
fin = fopen("stamps.in", "r");
fout = fopen("stamps.out", "w");
/*get input*/
memset(values, 0, 50*sizeof(int));
fscanf(fin, "%d %d", &K, &N);
for (i=0; i<N; i++)
{
fscanf(fin, "%d", &values[i]);
if (values[i] > max_value)
{
max_value = values[i];
}
}
/*begin DP*/
f = (int *)malloc((K*max_value+2)*sizeof(int));
for (i=0; i<=K*max_value+1; i++)
{
f[i] = K + 1;
}
f[0] = 0;
for (i=1; i<=K*max_value+1; i++)
{
min = K + 1;
for (j=0; j<N; j++)
{
if ((i - values[j]) >= 0)
{
if (f[i - values[j]] < min)
{
min = f[i - values[j]];
}
}
}
f[i] = min + 1;
}
for (i=0; i<=K*max_value+1; i++)
{
if (f[i] > K)
{
fprintf(fout, "%d\n", i-1);
break;
}
}
return 0;
}