Live2d Test Env

随笔分类 -  数学---二分 三分

摘要:传送门:Zoj2002题目大意:从左到右把一排数字k分,得到最小化最大份,如果有多组解,左边的尽量小。思路:贪心+二分(参考青蛙过河)。方向:从右向左。注意:有可能最小化时不够k分。如 ... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(116) 评论(0) 推荐(0)
摘要:Root of the ProblemTime Limit: 2 Seconds Memory Limit:65536 KB Given positive integers B and N, find an integer A such that AN is as close as pos... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(173) 评论(0) 推荐(0)