poj 3628 Bookshelf 2
2014-03-03 11:39
218 查看
Bookshelf 2
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 Hi (1 ≤ Hi ≤ 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: Hi
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
Sample Output
Source
USACO 2007 December Bronze
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7036 | Accepted: 3232 |
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 Hi (1 ≤ Hi ≤ 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: Hi
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
Source
USACO 2007 December Bronze
Source Code Problem: 3628 Memory: 216K Time: 47MS Language: C++ Result: Accepted Source Code #include<iostream> using namespace std; int mins=1000000000; int n,b; int h[20]; void find(int k,int sum){ if(k==n){ if(sum>=b && sum<mins) mins=sum; return; } if(sum>=mins) return; find(k+1,sum+h[k]); find(k+1,sum); } int main() { scanf("%d %d",&n,&b); for(int i=0;i<n;i++) scanf("%d",&h[i]); find(0,0); cout<<mins-b<<endl; return 0; }
相关文章推荐
- POJ 3628 Bookshelf 2 题解
- POJ 3628 Bookshelf 2
- poj 3628 Bookshelf 2
- poj3628 Bookshelf 2(0/背包)
- POJ 3628 Bookshelf 2 (01背包)
- poj3628 Bookshelf 2 DP 01背包
- Round 3 Bookshelf 2 POJ - 3628 -搜索(假背包)
- POJ 3628 Bookshelf 2(背包)
- poj 3628 Bookshelf 2(0/1背包)
- poj 3628 Bookshelf 2 01背包
- POJ 3628 Bookshelf 2 0-1背包 or DFS 水题
- POJ 3628 Bookshelf 2(用DFS做01背包)
- poj-3628-Bookshelf 2
- POJ 3628 Bookshelf 2 0/1背包和DFS两种解法
- POJ 3628 - Bookshelf 2
- POJ - 3628 Bookshelf 2
- POJ 3628 Bookshelf 2【01背包】
- POJ 3628 Bookshelf 2
- poj 3628 Bookshelf 2 01背包
- POJ 3628 Bookshelf 2 (01背包)