Monthly Expense（二分--最小化最大值）

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

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.

题意：农场主john为了节省开支自己做了一个预算。他已经计算好了接下来几天每天要花的钱，他将这些天分为m个时间段，要求分得各组的花费之和应该尽可能地小，最后输出各组花费之和中的最大值。

分析：这是一个最小化最大值的问题，二分枚举即可。

 #include <iostream>
 #include<cstring>
 #include<cmath>
 #include<cstdio>
 #include<algorithm>
 using namespace std;
 typedef long long ll;
 const int MAXN=1e5+;
 const int Inf=0x3f3f3f3f;
 int m,n;
 int str[MAXN];
 int solve(int mid)
 {
     int sum=,cnt=;
     for(int i=;i<m;i++)
     {
         if(sum+str[i]<=mid)
         {
             sum+=str[i];
         }
         else
         {
             sum=str[i];
             cnt++;
         }
     }
     if(cnt>n)
         return ;
     return ;
 }
 int main()
 {
     while(scanf("%d%d",&m,&n)!=-)
     { int left=,right=,mid;
     for(int i=;i<m;i++)
     {
         scanf("%d",&str[i]);
         right+=str[i];
         left=max(left,str[i]);
     }
     while(left<=right)
     {
         mid=(right+left)/;
         if(solve(mid))
         {
             right=mid-;
         }
         else
         {
             left=mid+;
         }
     }
     printf("%d\n",mid);}
     return ;
 }