UVA 714 Copying Books 最大值最小化问题 (贪心 + 二分)
Copying Books |
Before the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so called scribers. The scriber had been given a book and after several months he finished its copy. One of the most famous scribers lived in the 15th century and his name was Xaverius Endricus Remius Ontius Xendrianus (Xerox). Anyway, the work was very annoying and boring. And the only way to speed it up was to hire more scribers.
Once upon a time, there was a theater ensemble that wanted to play famous Antique Tragedies. The scripts of these plays were divided into many books and actors needed more copies of them, of course. So they hired many scribers to make copies of these books. Imagine you have m books (numbered ) that may have different number of pages (
) and you want to make one copy of each of them. Your task is to divide these books among k scribes,
. Each book can be assigned to a single scriber only, and every scriber must get a continuous sequence of books. That means, there exists an increasing succession of numbers
such that i-th scriber gets a sequence of books with numbers between bi-1+1 and bi. The time needed to make a copy of all the books is determined by the scriber who was assigned the most work. Therefore, our goal is to minimize the maximum number of pages assigned to a single scriber. Your task is to find the optimal assignment.
Input
The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly two lines. At the first line, there are two integers m and k, . At the second line, there are integers
separated by spaces. All these values are positive and less than 10000000.
Output
For each case, print exactly one line. The line must contain the input succession divided into exactly k parts such that the maximum sum of a single part should be as small as possible. Use the slash character (`/') to separate the parts. There must be exactly one space character between any two successive numbers and between the number and the slash.
If there is more than one solution, print the one that minimizes the work assigned to the first scriber, then to the second scriber etc. But each scriber must be assigned at least one book.
Sample Input
2
9 3
100 200 300 400 500 600 700 800 900
5 4
100 100 100 100 100
Sample Output
100 200 300 400 500 / 600 700 / 800 900
100 / 100 / 100 / 100 100
题意:给定一个n个数的序列。要求分为m个连续子序列。要求出一种划分方法使得。子序列的和的最大值。是最小的。
思路:LRJ书上的最大值最小化问题。把问题转换为能否把输入序列划分成m个子序列使得所有和不超过x。如果为假。就往上找。如果为真就往下找。一开始可以定下界为序列中最小的数字。上界上序列之和。然后进行二分查找。
过程中判断划分的方法是用了贪心。尽量往右边划分。。
这题在输出的地方折腾了我好一会- - 蛋都碎了。。注意如果剩下的数字已经等于还要插入'/'的数量,那么每个剩下每个数字之间直接全部插入’/‘即可。。
还有个注意点。就是二分的时候要记得用longlong。。。
代码:
#include <stdio.h>
#include <string.h> int t;
int n, m;
long long start, end;
int num[505];
int out[505];
int outn;
int judge(int x) {//判断能否把输入序列划分成m个连续子序列。。
int sb = n - 1;
for (int i = 0; i < m; i ++) {
long long sum = 0;
while (sum + num[sb] <= x) {
sum += num[sb];
if (sb == 0)
return 1;
sb --;
}
}
return 0;
}
int main() {
scanf("%d", &t);
while (t --) {
start = 10000000;
outn = 0;
memset(out, 0, sizeof(out));
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i ++) {
scanf("%d", &num[i]);
end += num[i];
if (start > num[i])
start = num[i];
}
long long sb;//记得long long不然会悲剧。。
while (start < end) {//二分查找
sb = (start + end) / 2;
if (judge(sb)) {
if (end == sb)
break;
end = sb;
}
else {
if (start == sb)
break;
start = sb;
}
}
if (!judge(sb))
sb ++;
int i = n - 1;
while (i != -1){//用一个out来判断输出'/'的位置。。
long long sum = 0;
while (sum + num[i] <= sb) {
sum += num[i --];
if (i == -1)
break;
}
if (i != -1) {
out[i] = 1;
outn ++;
}
}
if (outn != m - 1) {//如果'/'不足。在前面几个数之间补满'/'
for (int i = 0; i < n; i ++) {
if (!out[i]) {
out[i] = 1;
outn ++;
if (outn == m - 1)
break;
}
}
}
for (int i = 0; i < n - 1; i ++) {
printf("%d ", num[i]);
if (out[i]) printf("/ ");
}
printf("%d\n", num[n - 1]);
}
return 0;
}
UVA 714 Copying Books 最大值最小化问题 (贪心 + 二分)的更多相关文章
- UVa 714 Copying Books(二分)
题目链接: 传送门 Copying Books Time Limit: 3000MS Memory Limit: 32768 KB Description Before the inventi ...
- uva 714 Copying Books(二分法求最大值最小化)
题目连接:714 - Copying Books 题目大意:将一个个数为n的序列分割成m份,要求这m份中的每份中值(该份中的元素和)最大值最小, 输出切割方式,有多种情况输出使得越前面越小的情况. 解 ...
- UVa 714 Copying books 贪心+二分 最大值最小化
题目大意: 要抄N本书,编号为1,2,3...N, 每本书有1<=x<=10000000页, 把这些书分配给K个抄写员,要求分配给某个抄写员的那些书的编号必须是连续的.每个抄写员的速度是相 ...
- UVa 714 Copying Books - 二分答案
求使最大值最小,可以想到二分答案. 然后再根据题目意思乱搞一下,按要求输出斜杠(这道题觉得就这一个地方难). Code /** * UVa * Problem#12627 * Accepted * T ...
- UVA 714 Copying Books 二分
题目链接: 题目 Copying Books Time limit: 3.000 seconds 问题描述 Before the invention of book-printing, it was ...
- uva 714 - Copying Books(贪心 最大值最小化 二分)
题目描写叙述开头一大堆屁话,我还细致看了半天..事实上就最后2句管用.意思就是给出n本书然后要分成k份,每份总页数的最大值要最小.问你分配方案,假设最小值同样情况下有多种分配方案,输出前面份数小的,就 ...
- UVA 714 Copying Books 抄书 (二分)
题意:把一个包含m个正整数的序列划分成k个非空的连续子序列.使得所有连续子序列的序列和Si的最大值尽量小. 二分,每次判断一下当前的值是否满足条件,然后修改区间.注意初始区间的范围,L应该为所有正整数 ...
- 【NOIP提高组2015D2T1】uva 714 copying books【二分答案】——yhx
Before the invention of book-printing, it was very hard to make a copy of a book. All the contents h ...
- UVA - 714 Copying Books (抄书)(二分+贪心)
题意:把一个包含m个正整数的序列划分成k个(1<=k<=m<=500)非空的连续子序列,使得每个正整数恰好属于一个序列(所有的序列不重叠,且每个正整数都要有所属序列).设第i个序列的 ...
随机推荐
- webform 简单的服务器控件。
服务器基本控件: 1 textbox text:获取或设置文本 textmode:单行/多行/密码... wrap:是否换行 rows:行数 ...
- 修改登录linux之后显示的默认文件夹目录
命令如下: ll -a vim .bash_profile 最后一行加上cd 需要显示的文件夹
- vsftp的设置选项
设置匿名用户上传的文件的权限: anon_umask= 匿名用户新增文件的umask 数值.默认值为077. VSFTPD的设置选项 VSFTPD的配置文件/etc/vsftpd/vsftp ...
- web项目环境搭建(2):整合SpringMVC+velocity
velocity是一个基于java的模板引擎.velocity应用于web开发时,前端设计人员可以只关注页面的显示效果,而java程序人员只关注业务逻辑代码.velocity将java代码从web页面 ...
- Qt Quick App的两种启动模式
QQmlApplicationEngine搭配Window QQuickView搭配Item 两者不同之处在于: 使用QQuickView显示QML文档,对窗口的控制权(比如设置窗口标题.Icon.窗 ...
- 查看文件系统类型的Linux命令
不需挂载就能查看的命令: 1. file [root@localhost dev]# file -s /dev/sda1 /dev/sda1: Linux rev 1.0 ext4 filesy ...
- Cocos2d-x 使用物理引擎进行碰撞检测
[转自]: http://blog.csdn.net/cbbbc/article/details/38541099 通常在游戏简单逻辑判断和模拟真实的物理世界时,我们只需要在定时器中判断游戏中各个精灵 ...
- nginx读书日志
2016.12.20 nginx 功能特性: 既可以作为http服务器,也可以作为反向代理服务器或者邮件服务器 基本服务:处理静态文件,处理索引文件以及支持自动索引 nginx服务器中主要由proxy ...
- C51程序优化
1.指针: 对于大部分的编译器,使用指针比使用数组生成的代码更短,执行效率更高.但是在Keil中则相反,使用数组比使用的指针生成的代码更短.通常使用自加.自减指令和复合赋值表达式(如a-=1及a+=1 ...
- openwrt上wifi探针的实现
openwrt上wifi探针的实现 探针是通过wifi搜集经过这个AP范围的手机的mac地址,没有什么深刻的东西,知乎上关于这个东西讨论的很多,有人觉得很有用,可以做很多增值的应用,有人觉得没啥用,不 ...