POJ3628 Bookshelf 2(01背包+dfs)

Bookshelf 2

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8745		Accepted: 3974

Description

Farmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.

FJ has N cows (1 ≤ N ≤ 20) each with some height of H_i (1 ≤ H_i ≤ 1,000,000 - these are very tall cows). The bookshelf has a height of B (1 ≤ B ≤ S, where S is the sum of the heights of all cows).

To reach the top of the bookshelf, one or more of the cows can stand on top of each other in a stack, so that their total height is the sum of each of their individual heights. This total height must be no less than the height of the bookshelf in order for the cows to reach the top.

Since a taller stack of cows than necessary can be dangerous, your job is to find the set of cows that produces a stack of the smallest height possible such that the stack can reach the bookshelf. Your program should print the minimal 'excess' height between the optimal stack of cows and the bookshelf.

Input

* Line 1: Two space-separated integers: N and B
* Lines 2..N+1: Line i+1 contains a single integer: H_i

Output

* Line 1: A single integer representing the (non-negative) difference between the total height of the optimal set of cows and the height of the shelf.

Sample Input

5 16
3
1
3
5
6

Sample Output

1

题意：　求N个数中和比减16最小的。
5+6+3+3 - 16 = 1最小的是1；
01背包，背包的容量是所有的数累加起来的和sum，想想为什么呢，可以累加起来的和一定比给的那个数大，然后就从b-sum查找背包中的比b大的第一个数就ok了，
很棒的转换
dfs也能轻松搞定

 1 #include <iostream>
 2 #include <cstring>
 3 #include <algorithm>
 4 #include <cstdio>
 5 using namespace std;
 6 const int INF = 0x3f3f3f3f;
 7 const int MAX = 2000000 + 10;
 8 int dp[MAX],sum,a[MAX];
 9 
10 int main()
11 {
12     int n,b;
13     while(scanf("%d%d", &n,&b) != EOF)
14     {
15         for(int i = 1; i <= n; i++)
16         {
17             scanf("%d", &a[i]);
18             sum += a[i];
19         }
20         memset(dp, 0, sizeof(dp));
21         for(int i = 1; i <= n; i ++)
22         {
23             for(int j = sum; j >= a[i]; j--)
24             {
25                 dp[j] = max(dp[j],dp[j - a[i]] + a[i]);
26             }
27         }
28         for(int i = b; i <= sum; i++)
29         {
30             if(dp[i] >= b)
31             {
32                 printf("%d\n",dp[i] - b);
33                 break;
34             }
35         }
36 
37     }
38 
39     return 0;
40 }

View Code

 

转载于:https://www.cnblogs.com/zhaopAC/p/5036750.html