3273:Monthly Expense

题目描述

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 ≤ MN) 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.

输入解释
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
输出解释
Line 1: The smallest possible monthly limit Farmer John can afford to live with.
输入样例
7 5
100
400
300
100
500
101
400
输出样例
500
提示
If Farmer John schedules the months so that the first two days are a month, the third and fourth are a month, and the last three are their own months, he spends at most $500 in any month. Any other method of scheduling gives a larger minimum monthly limit.

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-3273

最后修改于 2020-10-29 06:57:28 UTC 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000 65536

·

·

·

·

登陆或注册以提交代码