Bin Packing - UVALive 3503 贪心
来源:互联网 发布:减肥前后对比知乎 编辑:程序博客网 时间:2024/06/01 07:27
Description
A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l and each item i has length lil . We look for a minimal number of bins q such that
- each bin contains at most 2 items,
- each item is packed in one of the q bins,
- the sum of the lengths of the items packed in a bin does not exceed l .
You are requested, given the integer values n , l , l1 , ..., ln , to compute the optimal number of bins q .
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 (1n105) . The second line contains one integer that corresponds to the bin length l10000 . We then have n 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
1108070153035108020351030
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.
题意:让最多两块组合起来,并且限定最大长度,使得组数最少。
思路:让最长的和最短的匹配。
AC代码如下:
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>using namespace std;int num[100010];int main(){ int T,t,n,len,i,j,k,ans,l,r; scanf("%d",&T); for(t=1;t<=T;t++) { scanf("%d%d",&n,&len); ans=0; for(i=1;i<=n;i++) scanf("%d",&num[i]); sort(num+1,num+1+n); l=1;r=n; while(l<r) { if(num[l]+num[r]<=len) { ans++; l++; r--; } else { ans++; r--; } } if(l==r) ans++; if(t!=1) printf("\n"); printf("%d\n",ans); }}
- Bin Packing - UVALive 3503 贪心
- poj2782 -- Bin Packing(贪心)
- Uva1149 Bin Packing【贪心】
- poj 2782 Bin Packing (贪心)
- UVa 1149 - Bin Packing [贪心]
- 1149 - Bin Packing(贪心)
- poj2782 Bin Packing(贪心)
- (简单贪心)Bin Packing
- UVA 1149 Bin Packing(贪心)
- 【hoj】2160 bin packing 二分、贪心
- UVA 10162 Bin Packing(贪心)
- 【uva】1149-Bin Packing(贪心 + STL )
- UVA - 1149 Bin Packing 贪心水题
- UVA 1149 bin packing (贪心)
- UVA 1149 Bin Packing 装箱(简单贪心)
- uva 1149 Bin Packing(贪心)
- UVa 1149 Bin Packing (二分 + 贪心)
- UVa 1149 - Bin Packing(贪心+二分查找)
- android 修改AVD的存放位置
- Android 之Navicat for SQLite 数据库介绍
- opencv-阈值化处理
- CDN总结之四
- 用cmd进入MySql解决MySql窗口不够大的问题
- Bin Packing - UVALive 3503 贪心
- LINUX总结第8篇:Ubuntu下搭建java开发环境
- UVA 756 - Biorhythms(数论)
- myeclipse导入项目项目名上有个红叉,但代码没有报错
- Qt学习之路(1):前言
- android网上服装购物系统
- bnu 34981 A Matrix(构造)
- 【数字图像处理之(一)】数字图像处理与相关领域概述
- 黑马程序员--循环语句while for