poj 3273 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 ≤ 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

给出农夫在n天中每天的花费，要求把这n天分作m组，每组的天数必然是连续的，要求分得各组的花费之和应该尽可能地小，最后输出各组花费之和中的最大值

首先二分搜索解决的问题必须具备单调性这个性质，这是使用二分搜索的必要条件，我们分析两个问题。

1.最小值最大化：我们假设x为最大的最小值，那么x-1是满足条件的，但他并不满足最大，x+1是不满足条件的，

2.最大值最小化：我们假设x为最小的最大值，那么x-1是不满足条件的，x+1是满足条件的，但他不满足最小

 

#include <iostream>
#include <cstdio>
#include <algorithm>
#define INF 1000000
using namespace std;
int main()
{
  int n;
  int a[100000],m;
  while(cin>>n>>m)
  {
      int  low=0,high=0,value=0,mid;
      for(int i=0;i<n;++i)
        {
              scanf("%d",&a[i]);

             if(low<a[i])
                low=a[i];
              high+=a[i];
        }
         while(low<=high)
         {
             int ant=0,sum=0,ans=0,i,k=0;
             mid=low+(high-low)/2;
            
              for(i=k;i<n;++i)
             {
                if(sum+a[i]<=mid)
                {
                 sum+=a[i];
                }
                else
                {
                  sum=a[i];
                  ans++;
                }
             }
             if(ans>=m)
             {
                low=mid+1;//mid-1是满足条件的，但是不满足最大
              }
         else
            high=mid-1;

         }
         cout<<mid<<endl;
    }
    return 0;
}

....开心中的悲桑，，