USACO3.1.5 Stamps (stamps)

简单的dp问题

用f[ i ]记录邮资为i最少用多少枚邮票，当f[ i ]大于k时， i-1 即为答案

/*
ID:xsy97051
LANG:C++
TASK:stamps
*/
#include <iostream>
#include <cstdio>
using namespace std;
int f[2000005],a[50],i,j,n,k;
    
int main()
{
	freopen("stamps.in","r",stdin);
	freopen("stamps.out","w",stdout);
	cin>>k>>n;
    for(i=1;i<=n;i++)
        cin>>a[i];
    f[0]=0;
	for(i=1;i<=2000000;i++)
    {
        f[i]=100000000;
        for(j=1;j<=n;j++)
            if(a[j]<=i)
		      f[i]=min(f[i],f[i-a[j]]+1);
        
		if(f[i]>k) break;
    }
    cout<<i-1<<endl;
    return 0;
}