zoukankan      html  css  js  c++  java
  • 【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 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
  • 相关阅读:
    mysql面试知识点
    计算机网络
    BFS
    拓扑排序
    双指针
    回溯算法
    hash表 算法模板和相关题目
    桶排序及其应用
    滑动窗口
    贪心算法
  • 原文地址:https://www.cnblogs.com/SBSOI/p/5574989.html
Copyright © 2011-2022 走看看