[USACO 13NOV]No Change

Description

Farmer John is at the market to purchase supplies for his farm. He has in his pocket K coins (1 <= K <= 16), each with value in the range 1..100,000,000. FJ would like to make a sequence of N purchases (1 <= N <= 100,000), where the ith purchase costs c(i) units of money (1 <= c(i) <= 10,000). As he makes this sequence of purchases, he can periodically stop and pay, with a single coin, for all the purchases made since his last payment (of course, the single coin he uses must be large enough to pay for all of these). Unfortunately, the vendors at the market are completely out of change, so whenever FJ uses a coin that is larger than the amount of money he owes, he sadly receives no changes in return!

Please compute the maximum amount of money FJ can end up with after making his N purchases in sequence. Output -1 if it is impossible for FJ to make all of his purchases.

约翰到商场购物，他的钱包里有K(1 <= K <= 16)个硬币，面值的范围是1..100,000,000。

约翰想按顺序买 N个物品(1 <= N <= 100,000)，第i个物品需要花费c(i)块钱，(1 <= c(i) <= 10,000)。

在依次进行的购买N个物品的过程中，约翰可以随时停下来付款，每次付款只用一个硬币，支付购买的内容是从上一次支付后开始到现在的这些所有物品（前提是该硬币足以支付这些物品的费用）。不幸的是，商场的收银机坏了，如果约翰支付的硬币面值大于所需的费用，他不会得到任何找零。

请计算出在购买完N个物品后，约翰最多剩下多少钱。如果无法完成购买，输出-1

Input

• Line 1: Two integers, K and N.

• Lines 2..1+K: Each line contains the amount of money of one of FJ's coins.

• Lines 2+K..1+N+K: These N lines contain the costs of FJ's intended purchases.

Output

• Line 1: The maximum amount of money FJ can end up with, or -1 if FJ cannot complete all of his purchases.

Sample Input

3 6
12
15
10
6
3
3
2
3
7

Sample Output

12

HINT

FJ has 3 coins of values 12, 15, and 10. He must make purchases in sequence of value 6, 3, 3, 2, 3, and 7.

FJ spends his 10-unit coin on the first two purchases, then the 15-unit coin on the remaining purchases. This leaves him with the 12-unit coin.

题解

考虑硬币数很少我们将其状压。

令$f[i]$表示状态为$i$时最多能够付款多少。

然后枚举没用过的硬币，考虑用二分查找到最右端位置。

 //It is made by Awson on 2017.10.29
 #include <set>
 #include <map>
 #include <cmath>
 #include <ctime>
 #include <stack>
 #include <queue>
 #include <vector>
 #include <string>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 #define LL long long
 #define Min(a, b) ((a) < (b) ? (a) : (b))
 #define Max(a, b) ((a) > (b) ? (a) : (b))
 #define Abs(x) ((x) < 0 ? (-(x)) : (x))
 #define count COUNT
 using namespace std;
 const int N = ;
 const int SIZE = <<;
 int st[];

 int k, n;
 int ans = -;
 int f[SIZE+], a[], c[N+];

 int dev(int aim, int l) {
     int L = l, R = n, ans = l;
     while (L <= R) {
         int mid = (L+R)>>;
         if (c[mid]-c[l] <= aim) L = mid+, ans = mid;
         else R = mid-;
     }
     return ans;
 }
 int count(int bit) {
     int ans = ;
     for (int i = ; i < k; i++, bit >>= ) ans += a[i]*(!(bit&));
     return ans;
 }
 void work() {
     st[] = ; for (int i = ; i <= ; i++) st[i] = st[i-]<<;
     scanf("%d%d", &k, &n);
     for (int i = ; i < k; i++) scanf("%d", &a[i]);
     for (int i = ; i <= n; i++) scanf("%d", &c[i]), c[i] += c[i-];
     for (int i = ; i < st[k]; i++)
         for (int j = ; j < k; j++) if (!(i&st[j])) {
             int to = dev(a[j], f[i]);
             f[i|st[j]] = Max(f[i|st[j]], to);
             if (to == n) ans = Max(ans, count(i|st[j]));
         }
     printf("%d\n", ans);
 }
 int main() {
     work();
     return ;
 }