【NOIP提高组2015D2T1】uva 714 copying books【二分答案】——yhx
2016-05-02 16:45
387 查看
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
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
相关文章推荐
- 【NOIP提高组2015D2T1】uva 714 copying books【二分答案】——yhx
- linux 内核参数图解
- linux下安装php报错configure: error: Cannot find MySQL header files under /usr/include/mysql.
- MyElicpse整合Tomcat
- url.openStream()和url.openConnection().getInputStream()两者区别
- Jenkins+maven+svn+tomcat操作手册(一)
- CentOS6系升级Python2.7版本
- OpenCV—基本矩阵操作与示例
- 查看linux已安装jdk
- linux优先级、性能监控指令
- Linux 中使用iptables配置防火墙
- Linux常用命令之安装VMware10中安装CentOS 6.4
- shell脚本:cp某个目录下筛选(find)后的某些文件到另一个目录
- Linux内核学习笔记
- CentOS 6.0 图形(图解)安装教程
- 网站优化排名到首页到底要多久?
- linux 下tomcat安装
- rabbitmq的整体架构一览
- docker基本操作
- MAC OSX10.10上搭建Apache,PHP,MySQL5.6.22,phpMyAdmin开发环境