Monthly Expense--（二分）

Monthly Expense

Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 35   Accepted Submission(s) : 12

Problem 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: <i>N</i> and <i>M</i> <br>Lines 2..<i>N</i>+1: Line <i>i</i>+1 contains the number of dollars Farmer John spends on the <i>i</i>th day

 

Output

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

 

Sample Input

7 5100400300100500101400

 

Sample Output

500

就是求把数组分为连续的m段，使得和最大的一段的和尽量小，求出这个最大和，很经典的一种二分方式

代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<queue>
#include<cstring>
#include<map>
using namespace std;
#define inf 1000000
int n,m,a[100010];
int main()
{
    int i,cnt,sum,left,right,mid;
    scanf("%d%d",&n,&m);
    cnt=sum=0;
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        if(cnt<a[i]) cnt=a[i];
        sum+=a[i];
    }
    left=cnt; right=sum;  //给left，right找到上下限是很重要的一步
    while(left<right)
    {
        mid=(left+right)/2; //mid枚举最大的fjmonth花费的值,通过二分找mid正确值
        cnt=sum=0;
        for(i=0;i<n;i++)
        {
            sum+=a[i];
            if(sum>mid)  //加上a[i]后子段和大于了mid所以不能加a[i]于是i--,但是此时a[i]之前的新子段正好分好了且不大于mid
            {
                sum=0;
                cnt++;   //cnt记录用mid可以将n分为几段
                i--;
            }
        }
        cnt++; //加上剩下的一组
        if(cnt>m) left=mid+1;
        else right=mid-1;
    }
    printf("%d",left);
    return 0;
}