Monthly Expense （最大值最小化＋二分法）

原创

于 2017-08-16 09:30:10 发布 · 1k 阅读

4 ·

CC 4.0 BY-SA版权

文章标签：

#Monthly Expense #acm #C++ #二分法 #最大值最小化

农夫约翰面临财务困扰，需要规划连续的M个财政期（fajomonths），每个包含1天或多天，目标是通过排列fajomonths来最小化最高支出的月份，以此设定他的月预算上限。给定每天的花费，求最小可能的月支出限制。样例输入显示了一个7天、5个fajomonths的案例，输出为500美元，即最高月份的最低支出限制。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 ≤ money_i ≤ 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 sp