POJ 3628 Bookshelf 2(0-1背包)
来源:互联网 发布:张家界玻璃桥网络购票 编辑:程序博客网 时间:2024/05/12 15:27
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
5 1631356
Sample Output
1
AC代码:
#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;const int maxn=1e7+10;int dp[maxn];int value[maxn];int main(){int N,B;while(scanf("%d%d",&N,&B)==2){int sum=0;for(int i=1;i<=N;i++) { scanf("%d",&value[i]); sum+=value[i]; }memset(dp,0,sizeof(dp));for(int i=1;i<=N;i++){for(int j=sum;j>=0;j--){if(j>=value[i]) dp[j]=max(dp[j],dp[j-value[i]]+value[i]);}}for(int i=0;i<=sum;i++){if(dp[i]>=B){printf("%d\n",abs(B-dp[i]));break;}}}return 0;}
Description
Farmer John recently bought a bookshelf for cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.
Each of the N cows (1 ≤ N ≤ 20,000) has some height of Hi (1 ≤ Hi ≤ 10,000) and a total height summed across all N cows of S. The bookshelf has a height of B (1 ≤ B ≤ S < 2,000,000,007).
To reach the top of the bookshelf taller than the tallest cow, 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. Since more cows than necessary in the stack can be dangerous, your job is to find the set of cows that produces a stack of the smallest number of cows possible such that the stack can reach 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 size of the smallest set of cows that can reach the bookshelf.
Sample Input
6 4061811131911
Sample Output
3
分析:排序+贪心
AC代码;
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=20000+10;int value[maxn]; int main(){int N,B;while(scanf("%d%d",&N,&B)==2){int sum=0;for(int i=0;i<N;i++){scanf("%d",&value[i]);sum+=value[i];}sort(value,value+N);int ans=N;for(int i=0;i<N;i++){if((sum-=value[i])>=B)ans--;else break;}printf("%d\n",ans);}return 0;}
- poj 3628 Bookshelf 2 (0/1背包)
- POJ 3628 Bookshelf 2 0-1背包
- POJ 3628 Bookshelf 2(0-1背包)
- poj 3628 Bookshelf 2( 0-1背包。)
- POJ 3628 Bookshelf 2 DFS 0-1背包问题
- POJ 3628 Bookshelf 2 0-1背包 or DFS 水题
- poj 3628 Bookshelf 2(0/1背包)
- POJ 3628 Bookshelf 2(背包)
- poj 3628 Bookshelf 2 背包
- poj 3628 Bookshelf 2 01背包
- poj 3628 Bookshelf 2 01背包!!!
- poj 3628 Bookshelf 2 01背包
- POJ 3628 Bookshelf 2 (01背包)
- [01背包]POJ 3628 Bookshelf 2
- POJ 3628 Bookshelf 2(DP:01背包)
- poj 3628 Bookshelf 2 01背包
- POJ 3628 Bookshelf 2 (01背包)
- poj 3628 Bookshelf 2(01背包)
- 290. Word Pattern
- No Hibernate Session bound to thread, and configuration
- C++11的右值引用(一)——左值(lvalue),纯右值(prvalue)和将亡值(xvalue)
- css布局之浮动模型&&左右两栏自适应布局
- C++11 并发指南六(atomic 类型详解三 std::atomic (续))
- POJ 3628 Bookshelf 2(0-1背包)
- 3dMax9 注册机使用
- Topological Sorting(拓扑排序)
- tomcat服务器报NullPointerException,tomcat域名配置
- C++11 并发指南六(atomic 类型详解四 C 风格原子操作介绍)
- 被动回调接口
- PAT甲级1031. Hello World for U (20)
- [MySQL]--查询性能优化
- Ubuntu16.04+Cuda8.0+Caffe+ Opencv3.2+Matlab2015b的配置、安装与编译(四)