http://poj.org/problem?id=3273
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 ≤ 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 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.
Source |
一共N天,分成M份,求M份中最大值的最小值
二分,上界的钱的总和,下界是单日开销中的最大值
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<ctime>
#include<cctype>
#include<cmath>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#define sqr(x) (x)*(x)
#define INF 0x1f1f1f1f
#define PI 3.1415926535
#define LL long long
#define mm 100010
using namespace std;
int money[mm];
int n,m,le,ri;
int main()
{
scanf("%d%d",&n,&m);
le=ri=0;
for (int i=0;i<n;i++)
{
scanf("%d",&money[i]);
le=max(money[i],le); //下界
ri+=money[i]; //上届
}
while (le<ri)
{
int mid=(le+ri)>>1;
int now=0,cnt=0;
for (int i=0;i<n;i++)
{
if (now+money[i]>mid)
{
cnt++;
now=money[i];
}
else
{
now+=money[i];
}
if (cnt>m)
{
break;
}
}
cnt++; //最后一份还没算,这里要注意
if (cnt>m)
{
le=mid+1;
}
else
{
ri=mid;
}
}
printf("%d\n",le);
return 0;
}