POJ 3273 Monthly Expense 二分

最新推荐文章于 2019-05-04 16:29:01 发布

EnormousZhou

最新推荐文章于 2019-05-04 16:29:01 发布

阅读量220

点赞数

分类专栏：算法文章标签：源代码算法

本文链接：https://blog.csdn.net/qq_33414630/article/details/50761799

版权

算法专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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

500

题目大意：给出农夫在n天中每天的花费，要求把这n天分作m组，每组的天数必然是连续的，要求分得各组的花费之和中的最大的一组的花费最少。完全符合大神讲的二分的特征。

#include <iostream>
using namespace std;
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        int money[100005],max=0,sum=0,left,mid,right;
        for(int i=0;i<n;i++)
        {
            cin>>money[i];
            sum+=money[i];
            if(max<money[i])
                max=money[i];
        }
        left=max;
        right=sum;
        while(left<right)
        {
            int cnt=0,tem=0;
            mid=left+(right-left)/2;
            for(int i=0;i<n;i++)
            {
                tem+=money[i];
                if(tem>mid)
                {
                    cnt++;
                    tem=money[i];
                }
            }
            cnt++;
            if(cnt>m)
                left=mid+1;
            else right=mid-1;
        }
        cout<<left<<endl;
    }
}