HBC25062Charging,数据结构,线段树[USACO 2007 Mar S]Monthly Expense题解

挑战自我，勇攀编程高峰！全网最全C++题库，助您成为编程达人。

≤ 10,000) that he will need to spend each day over the next N days.FJ wants to create a budget for a sequential set of exactly M 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.

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 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 spending limit.

标签： HBC25062Charging 数据结构 线段树[USACO 2007 Mar S]Monthly Expense题解