POJ3273：Monthly Expense(二分)

Description

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 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

Output

Line 1: The smallest possible monthly limit Farmer John can afford to live with.

Sample Input

Sample Output

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.

题意：这题看了好久都没看懂题意，就是将序列划分为k段，要求找出k段中最大的资金和要在所有符合要求的划分中值最少

思路：我们可以直到这个值必然在所有数中最大值与所有数的总和之间，那么只要再这个区间进行二分即可

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int a[100005];
int main()
{
int n,m;
int sum,maxn,i,j,s,cnt,mid;
while(~scanf("%d%d",&n,&m))
{
sum = 0,maxn = 0;
for(i = 0; i<n; i++)
{
scanf("%d",&a[i]);
sum+=a[i];
maxn = max(maxn,a[i]);
}
while(maxn<sum)
{
mid = (sum+maxn)>>1;
s = 0,cnt = 0;
for(i = 0; i<n; i++)
{
s+=a[i];
if(s>mid)
{
s = a[i];
cnt++;
}
}
if(cnt<m) sum = mid;
else maxn = mid+1;
}
printf("%d\n",maxn);
}
return 0;
}

POJ3273：Monthly Expense(二分)相关推荐

【POJ 3273】 Monthly Expense (二分)
[POJ 3273] Monthly Expense (二分) 一个农民有块地他列了个计划表每天要花多少钱管理但他想用m个月来管理就想把这个计划表切割成m个月来完毕想知道每一个月最少花费多少 ...
Monthly expense(二分）
又又又又是二分啦憨憨桃子又来啦题目链接:monthly expense 题目描述: Farmer John is an astounding accounting wizard and has r ...
poj3273 Monthly Expense(花销)-二分查找
题意描述给定n天的花销,把花销分成连续的m份,使得每一段时间花销和的最大值最小. 样例输入 7 5 100 400 300 100 500 101 400 样例输出 500 思路设每天花销为exp ...
POJ-3273 Monthly Expense 解题报告
Description Farmer John is an astounding accounting wizard and has realized he might run out of mone ...
BZOJ 1639: [Usaco2007 Mar]Monthly Expense 月度开支( 二分答案 )
直接二分答案然后判断. ----------------------------------------------------------------------------- #include&l ...
bzoj 1639: [Usaco2007 Mar]Monthly Expense 月度开支（二分）
1639: [Usaco2007 Mar]Monthly Expense 月度开支 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 1057 Solve ...
Monthly Expense（二分）
Monthly Expense Farmer John is an astounding accounting wizard and has realized he might run out of ...
Monthly Expense【二分】
B - Monthly Expense POJ - 3273 Farmer John is an astounding accounting wizard and has realized he mi ...
二分搜索 POJ 3273 Monthly Expense
题目传送门 1 /* 2 题意:分成m个集合,使最大的集合值(求和)最小 3 二分搜索:二分集合大小,判断能否有m个集合. 4 */ 5 #include <cstdio> 6 #incl ...

POJ3273：Monthly Expense(二分)

POJ3273：Monthly Expense(二分)相关推荐

最新文章

热门文章