农夫约翰面临财务问题，需要规划连续的M个财政期（fajomonths），每个包含连续的天数，目标是最小化最高支出的月份。输入包含每天的花费，输出最小可能的月预算限制。样例表明，通过合理安排，可以将最大支出控制在500美元。解题策略使用二分查找确定合适区间。
Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi ≤ 10,000) that he will need to spend each day over the next N (1 ≤ N ≤ 100,000) days.
FJ wants to create a budget for a sequential set of exactly M (1 ≤ M ≤ N) fiscal periods called “fajomonths”. Each of these fajomonths contains a set of 1 or more consecutive days. Every day is contained in exactly one fajomonth.
FJ’s goal is to arrange the fajomonths so as to minimize the expenses of the fajomonth with the highest spending and thus determine his monthly spending limit.
Input
Line 1: Two space-separated integers: N and M
Lines 2… N+1: Line i+1 contains the number of dollars Farmer John spends on the ith day
Output
Line 1: The smallest possible monthly limit Farmer John can afford to live with.
最低0.47元/天 解锁文章
扫一扫
8840
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
