Day3-N - Monthly Expense POJ3273
2024-09-07 00:42:39
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
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.
Sample Input
7 5
100
400
300
100
500
101
400
Sample Output
500
Hint
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.
简述:给出长度n的数组以及m,求分成m段且每段和最小的和。
思路:可以贪心验证,这个最小和是单调的,可以二分搜索,代码如下:
const int maxm = ;
const int INF = 0x7fffffff; int n, buf[maxm], m; bool check(int d) {
int sum = , now = buf[];
for (int i = ; i < n; ++i) {
if(now + buf[i] <= d)
now += buf[i];
else {
now = buf[i];
++sum;
}
}
return sum <= m;
} int main() {
int l = -INF, r = , mid;
scanf("%d%d", &n, &m);
for(int i = ; i < n; ++i) {
scanf("%d", &buf[i]);
l = max(l, buf[i]);
r += buf[i];
}
while(l <= r) {
mid = (l + r) >> ;
if(check(mid))
r = mid - ;
else
l = mid + ;
}
printf("%d\n", l);
return ;
}
最新文章
- fillStyle图片填充
- Java读带有BOM的UTF-8文件乱码原因及解决方法
- 成功进行了一次UDP打洞
- 使用Javascript实现返回顶部功能。
- Amazon Web Services
- MAC自带的SVN进行升级
- jdk5下载链接
- Highcharts-3.0.6
- iOS 创建上线证书
- maven_基本配置
- 为Android增加硬件抽象层(HAL)模块访问Linux内核驱动程序
- Spring学习(22)--- AOP之Advice应用(下)
- 算法训练 K好数
- File文件的读写操作RandomAccessFile类
- ;html5斜体字
- Intellij IDEA常用快捷键介绍 Intellij IDEA快捷键大全汇总
- 2. github创建 git仓库,克隆,拉取和推送操作(所有的git命令前提是一定在当前项目目录下)
- 电子商务(电销)平台中订单模块(Order)数据库设计明细(转)
- react+mobx 编写 Async装饰器
- 人脸识别准备 -- 基于raspberry pi 3b + movidius