Bin Packing
2015-08-06 20:22
609 查看
Bin Packing
题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=85904#problem/F
题目:
A set of n<tex2html_verbatim_mark> 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l<tex2html_verbatim_mark> and each item i<tex2html_verbatim_mark> has length li
l<tex2html_verbatim_mark> . We look for a minimal number of bins q<tex2html_verbatim_mark> such that
each bin contains at most 2 items,
each item is packed in one of the q<tex2html_verbatim_mark> bins,
the sum of the lengths of the items packed in a bin does not exceed l<tex2html_verbatim_mark> .
You are requested, given the integer values n<tex2html_verbatim_mark> , l<tex2html_verbatim_mark> , l1<tex2html_verbatim_mark> , ..., ln<tex2html_verbatim_mark> , to compute the optimal number of bins q<tex2html_verbatim_mark> .
The first line of the input file contains the number of items n<tex2html_verbatim_mark>(1
n
105)<tex2html_verbatim_mark> . The second line contains one integer that corresponds to the bin length l
10000<tex2html_verbatim_mark> . We then have n<tex2html_verbatim_mark> lines containing one integer value that represents the length of the items.
For each input file, your program has to write the minimal number of bins required to pack all items.
Note: The sample instance and an optimal solution is shown in the figure below. Items are numbered from 1 to 10 according to the input order.
[align=CENTER] [/align]
题意:
给定n个物品的长度a[i],每个箱子的长度是l,同时要求每个箱子最多装两个物品。求至少要多少个箱子才能装下所有的物品。
分析:
将n个物品从长到短进行排序,比较最短值和最长值的和与箱子长度进行比较即可
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=85904#problem/F
题目:
A set of n<tex2html_verbatim_mark> 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l<tex2html_verbatim_mark> and each item i<tex2html_verbatim_mark> has length li
l<tex2html_verbatim_mark> . We look for a minimal number of bins q<tex2html_verbatim_mark> such that
each bin contains at most 2 items,
each item is packed in one of the q<tex2html_verbatim_mark> bins,
the sum of the lengths of the items packed in a bin does not exceed l<tex2html_verbatim_mark> .
You are requested, given the integer values n<tex2html_verbatim_mark> , l<tex2html_verbatim_mark> , l1<tex2html_verbatim_mark> , ..., ln<tex2html_verbatim_mark> , to compute the optimal number of bins q<tex2html_verbatim_mark> .
Input
The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.The first line of the input file contains the number of items n<tex2html_verbatim_mark>(1
n
105)<tex2html_verbatim_mark> . The second line contains one integer that corresponds to the bin length l
10000<tex2html_verbatim_mark> . We then have n<tex2html_verbatim_mark> lines containing one integer value that represents the length of the items.
Output
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.For each input file, your program has to write the minimal number of bins required to pack all items.
Sample Input
1 10 80 70 15 30 35 10 80 20 35 10 30
Sample Output
6
Note: The sample instance and an optimal solution is shown in the figure below. Items are numbered from 1 to 10 according to the input order.
[align=CENTER] [/align]
题意:
给定n个物品的长度a[i],每个箱子的长度是l,同时要求每个箱子最多装两个物品。求至少要多少个箱子才能装下所有的物品。
分析:
将n个物品从长到短进行排序,比较最短值和最长值的和与箱子长度进行比较即可
#include<iostream> #include<algorithm> using namespace std; int a[100005]; int main() { int t; cin>>t; while(t--) { int n,l,i,j=0; int count=0; cin>>n>>l; for( i=0;i<n;i++) cin>>a[i]; sort(a,a+n); for(i=n-1;i>=0;i--) { if(i==j) {count++;break;} if(a[i]+a[j]<=l) j++; count++; if(i==j) break; } cout<<count<<endl; if(t) cout<<endl; } return 0; }
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
[align=CENTER] [/align]
相关文章推荐
- scala 入门2
- MongoDB基本命令使用
- JavaScript基础----11Javascript函数-了解函数的用途
- Ganymed SSH-2 java执行远程linux机器命令工具
- Vmware Workstation 安装linux (CentOs)系统
- Hibernate学习笔记(二) — 探索 hibernate 中对象的状态
- dancing links 算法 解 Sudoku
- HDU - 5093 Battle ships 初学 二分图匹配
- 最大二分图hdu5091
- LeetCode(114) Flatten Binary Tree to Linked List
- JS学习第四天----可选的分号
- 10进制转化成其他进制
- 黑马程序员——java开发环境配置
- 虚拟机的安装和使用
- 驱动中以文件句柄形式调用其他驱动程序(同步调用)
- BizTalk Orchestration execute Flat file disassembler ReceivePipeline
- 贪心+优先队列 HDOJ 5360 Hiking
- hdu 1325 水题
- SQLServer 常用命令
- c++ 计蒜客冗余关系