【动态规划】【USACO】Stamps

 

Given a set of N stamp values (e.g., {1 cent, 3 cents}) and an upper limit K to the number of stamps that can fit on an envelope, calculate the largest unbroken list of postages from 1 cent to M cents that can be created.

For example, consider stamps whose values are limited to 1 cent and 3 cents; you can use at most 5 stamps. It's easy to see how to assemble postage of 1 through 5 cents (just use that many 1 cent stamps), and successive values aren't much harder:

• 6 = 3 + 3
• 7 = 3 + 3 + 1
• 8 = 3 + 3 + 1 + 1
• 9 = 3 + 3 + 3
• 10 = 3 + 3 + 3 + 1
• 11 = 3 + 3 + 3 + 1 + 1
• 12 = 3 + 3 + 3 + 3
• 13 = 3 + 3 + 3 + 3 + 1.

However, there is no way to make 14 cents of postage with 5 or fewer stamps of value 1 and 3 cents. Thus, for this set of two stamp values and a limit of K=5, the answer is M=13.

The most difficult test case for this problem has a time limit of 3 seconds.

PROGRAM NAME: stamps

INPUT FORMAT

Line 1:	Two integers K and N. K (1 <= K <= 200) is the total number of stamps that can be used. N (1 <= N <= 50) is the number of stamp values.
Lines 2..end:	N integers, 15 per line, listing all of the N stamp values, each of which will be at most 10000.

SAMPLE INPUT (file stamps.in)

5 2
1 3

OUTPUT FORMAT

Line 1:

One integer, the number of contiguous postage values starting at 1 cent that can be formed using no more than K stamps from the set.

SAMPLE OUTPUT (file stamps.out)

13

 
 
描述
已知一个 N 枚邮票的面值集合（如，{1 分，3 分}）和一个上限 K —— 表示信封上能够贴 K 张邮票。计算从 1 到 M 的最大连续可贴出的邮资。
例如，假设有 1 分和 3 分的邮票；你最多可以贴 5 张邮票。很容易贴出 1 到 5 分的邮资（用 1 分邮票贴就行了），接下来的邮资也不难：
6 = 3 + 3 
7 = 3 + 3 + 1 
8 = 3 + 3 + 1 + 1 
9 = 3 + 3 + 3 
10 = 3 + 3 + 3 + 1 
11 = 3 + 3 + 3 + 1 + 1 
12 = 3 + 3 + 3 + 3 
13 = 3 + 3 + 3 + 3 + 1

然而，使用 5 枚 1 分或者 3 分的邮票根本不可能贴出 14 分的邮资。因此，对于这两种邮票的集合和上限 K=5，答案是 M=13。
[规模最大的一个点的时限是3s]

小提示:因为14贴不出来,所以最高上限是13而不是15

[编辑]格式
PROGRAM NAME: stamps
INPUT FORMAT:
(file stamps.in)
第 1 行： 两个整数，K 和 N。K（1 <= K <= 200）是可用的邮票总数。N（1 <= N <= 50）是邮票面值的数量。
第 2 行 .. 文件末： N 个整数，每行 15 个，列出所有的 N 个邮票的面值，每张邮票的面值不超过 10000。
OUTPUT FORMAT:
(file stamps.out)
第 1 行：一个整数，从 1 分开始连续的可用集合中不多于 K 张邮票贴出的邮资数。

[编辑]SAMPLE INPUT
5 2
1 3


[编辑]SAMPLE OUTPUT
13
 

 
 

f[i]表示i的面值所需最少邮票数。
 
f[i]=min(f[i-v[j]])+1;
/*
ID:sephiro5
LANG:C++
PROG:stamps
*/
#include <stdio.h>
#define MAXINT 10000000
#define maxn 2000010
int f[maxn];
int v[100];
int n,k;
int main()
{
    freopen("stamps.in","r",stdin);
    freopen("stamps.out","w",stdout);
    
    scanf("%d%d",&k,&n);
    for (int i=1;i<=n;++i) scanf("%d",&v[i]);
    int i=1,min;
    while (1)
    {
          min=MAXINT;
          for (int j=1;j<=n;++j)
              if ((i-v[j]>=0)&&(f[i-v[j]]+1<min))
                 min=f[i-v[j]]+1;
          if (min>k) break;
          f[i]=min;
          ++i;
    }
    
    printf("%d/n",i-1);
    
    return 0;
}