文件名称:POJ3273
介绍说明－－下载内容均来自于网络，请自行研究使用
POJ3273 Monthly Expense题解
题目分析：
给出N个数，要求你合并连续的数，使其合并在满足不差过M个合并后的集合的时候，不超过M个集合的和的最大值最小。-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.
题目分析：
给出N个数，要求你合并连续的数，使其合并在满足不差过M个合并后的集合的时候，不超过M个集合的和的最大值最小。-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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
POJ3273题解.docx