Monthly Expense

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.
利用二分查找，上界为所有区间之和（一个大区间），下界为各个数的最大值（一数一区间），然后从中间开始计算可划分的连续区间个数，如果大于m，那么下界换为中间值，否则上界换为中间值。

#include<iostream>
#include<cstdio>

using namespace std;

int a[100010];

int main()
{
    int m,n,l=0,r=0,mid;
    cin>>n>>m;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        if(l<a[i]) l=a[i];
        r+=a[i];
    }
    while(l<=r)
    {
        int sum=0,cnt=1;
        mid=(l+r)>>1;
        for(int i=0;i<n;i++)
        {
            if(sum+a[i]<=mid) sum+=a[i];
            else
            {
                sum=a[i];
                cnt++;
            }
        }
        if(cnt<=m) r=mid-1;
        else l=mid+1;
    }
    cout<<l<<endl;
    return 0;
}