 　　连续邮资问题

提示：连续邮资问题：某国家发行了n种不同面值的邮票，并且规定每张信封上最多只允许贴m张邮票。连续邮资问题要求对于给定的n和m的值，给出邮票面值的最佳设计，在1张信封上贴出从邮资1开始，增量为1的最大连续邮资区间。例如，当n=5和m=4时，面值为{1,3,11,15,32}的5种邮票可以贴出的最大连续邮资区间是1到70.

-　continuous postage problem Tip: for postage issues: a state-issued n kinds of different denominations of stamps, and provides up to only allow the paste m stamp on each envelope. Consecutive postage value for a given n and m are given the best design of the stamps, in denominations, posted in an envelope, postage 1 increments for a maximum continuous postage interval. For example, when n = 5 and m = 4, the nominal value of {1,3,11,15,32} 5 kinds of stamps that can be posted maximum continuous postage range is 1-70.