题目链接:

题目

Copying Books

Time limit: 3.000 seconds

问题描述

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

1, 2, . . . , m) that may have different number of pages (p1, p2, . . . , pm) and you want to make one copy of

each of them. Your task is to divide these books among k scribes, k ≤ m. 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 0 = b0 < b1 < b2, . . . < bk−1 ≤ bk = m 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.

输入

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,

1 ≤ k ≤ m ≤ 500. At the second line, there are integers p1, p2, . . . , pm separated by spaces. All these

values are positive and less than 10000000.

输出

For each case, print exactly one line. The line must contain the input succession p1, p2, . . . pm 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.

样例

input

2

9 3

100 200 300 400 500 600 700 800 900

5 4

100 100 100 100 100

output

100 200 300 400 500 / 600 700 / 800 900

100 / 100 / 100 / 100 100

题意

给你n本书,现在让你把它们分为m堆,每一堆的书编号要连续,并且使得页数最多的那一堆的页数值最小。

题解

最大值最小,考虑二分。

二分最大堆的书页数小于等于x,然后只要贪心线性扫一遍,如果能分出少于m堆,则继续扩大答案,否则缩小。

由于多解的时候要让越前面的堆的页数越小。所以考虑从后面贪心往前面扫,因为后面的堆越大前面的就自然越小了,如果扫一遍发现分出的堆数不够,那就从前往后把没有分割的给分割开,直到分出m堆。

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define lson (o<<1)
#define rson ((o<<1)|1)
#define M L+(R-L)/2
using namespace std; typedef long long LL;
const int maxn=555;
const LL INF=(LL)5e9; int m,k;
int arr[maxn],tag[maxn];
int Ma; bool ok(LL ma){
if(ma<Ma) return false;
LL sum=0;
int cnt=0;
for(int i=0;i<m;i++){
sum+=arr[i];
if(sum>ma){
sum=arr[i];
cnt++;
}
}
cnt++;
return cnt<=k;
} int main(){
int tc;
scanf("%d",&tc);
while(tc--){
Ma=-1;
memset(tag,0,sizeof(tag));
scanf("%d%d",&m,&k);
for(int i=0;i<m;i++){
scanf("%d",&arr[i]);
Ma=max(Ma,arr[i]);
}
LL l=Ma-1,r=INF;
while(l+1<r){
LL mid=l+(r-l)/2;
if(ok(mid)) r=mid;
else l=mid;
}
LL sum=0; int cnt=1;
for(int i=m-1;i>=0;i--){
sum+=arr[i];
if(sum>r){
sum=arr[i];
cnt++;
tag[i]=1;
}
}
for(int i=0;i<m-1&&cnt<k;i++){
if(!tag[i]){
tag[i]=1; cnt++;
}
}
for(int i=0;i<m-1;i++){
printf("%d ",arr[i]);
if(tag[i]) printf("/ ");
}
printf("%d\n",arr[m-1]);
}
return 0;
}

UVA 714 Copying Books 二分的更多相关文章

  1. UVa 714 Copying Books - 二分答案

    求使最大值最小,可以想到二分答案. 然后再根据题目意思乱搞一下,按要求输出斜杠(这道题觉得就这一个地方难). Code /** * UVa * Problem#12627 * Accepted * T ...

  2. uva 714 Copying Books(二分法求最大值最小化)

    题目连接:714 - Copying Books 题目大意:将一个个数为n的序列分割成m份,要求这m份中的每份中值(该份中的元素和)最大值最小, 输出切割方式,有多种情况输出使得越前面越小的情况. 解 ...

  3. UVa 714 Copying Books(二分)

    题目链接: 传送门 Copying Books Time Limit: 3000MS     Memory Limit: 32768 KB Description Before the inventi ...

  4. UVA 714 Copying Books 最大值最小化问题 (贪心 + 二分)

      Copying Books  Before the invention of book-printing, it was very hard to make a copy of a book. A ...

  5. 【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 ...

  6. uva 714 - Copying Books(贪心 最大值最小化 二分)

    题目描写叙述开头一大堆屁话,我还细致看了半天..事实上就最后2句管用.意思就是给出n本书然后要分成k份,每份总页数的最大值要最小.问你分配方案,假设最小值同样情况下有多种分配方案,输出前面份数小的,就 ...

  7. UVa 714 Copying books 贪心+二分 最大值最小化

    题目大意: 要抄N本书,编号为1,2,3...N, 每本书有1<=x<=10000000页, 把这些书分配给K个抄写员,要求分配给某个抄写员的那些书的编号必须是连续的.每个抄写员的速度是相 ...

  8. UVA 714 Copying Books 抄书 (二分)

    题意:把一个包含m个正整数的序列划分成k个非空的连续子序列.使得所有连续子序列的序列和Si的最大值尽量小. 二分,每次判断一下当前的值是否满足条件,然后修改区间.注意初始区间的范围,L应该为所有正整数 ...

  9. UVA - 714 Copying Books (抄书)(二分+贪心)

    题意:把一个包含m个正整数的序列划分成k个(1<=k<=m<=500)非空的连续子序列,使得每个正整数恰好属于一个序列(所有的序列不重叠,且每个正整数都要有所属序列).设第i个序列的 ...

随机推荐

  1. Git之使用

    一大清早的,正在熟睡的我竟然被冻醒了,这天好冷啊,没事就先来扯一下犊子吧:我发现我养成了一个“怪”习惯:我老是一大早起来打开电脑就撸代码,到了中午和下午就去干别的事不想敲了.我们寝室的宿友总是被我敲代 ...

  2. Java之循环练习2

    吐槽O(∩_∩)O:由于前几天电脑坏了,除了在弄电脑的同时又在练习科目三了,又是晒了三天网鱼都没打了.计划还是赶不上变化,真的是让人乱了节拍啊.咔!吐槽完毕,让我们的循环练习继续. 练习一:一个人很倒 ...

  3. 四步完成ajax的使用

    什么是ajax? ajax(异步javascript xml) 能够刷新局部网页数据而不是重新加载整个网页. 如何使用ajax? 第一步,创建xmlhttprequest对象,var xmlhttp ...

  4. Xcode6 模拟器不显示键盘

    在学习加法计算器时,程序运行后发现点击模拟器上的输入框时有时候键盘可以弹出来,有时候又弹不出来. 网上查询结果只需要在模拟器的菜单中找到hardware -> keyboard -> 取消 ...

  5. UI3_UIbarButtonItem

    // // AppDelegate.m // UI3_UIbarButtonItem // // Created by zhangxueming on 15/7/6. // Copyright (c) ...

  6. app视觉设计艺术(读书笔记)

    一.移动互联网产品在变化 UI=用户界面 用户的界面-从属关系-视觉传达与美化界面设计 用户与界面-交互关系-从视觉"看到"->执行交互 层级化与理性思维 层级化 层级化是一 ...

  7. 判断Featureclass的类型

    一个Featureclass可以是Shapefile Feature Class.Personal Geodatabase Feature Class.File Geodatabase Feature ...

  8. Python单元测试——深入理解unittest (转)

    单元测试的重要性就不多说了,可恶的是Python中 有太多的单元测试框架和工具,什么unittest, testtools, subunit, coverage, testrepository, no ...

  9. Linux 我的第一个makefile(Linux指令学习笔记)

    我的第一个makefile 最近学到了makefile的文件的编写.makefile是一个能达到方便编译链接生成目标程序的文件, make确实很方便,在写makefile的过程也能更好的理解gcc编译 ...

  10. Enhanced RCP: How views can communicate – The e4 way | Tomsondev Blog

    Some weeks ago I published how views can communicate using the EventAdmin-Service. To get things wor ...