ACM: 一题二分搜索题 poj3273    (…

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

题意: 给出连续的n天里面 farm 的消费.  现在要做一个"fajomonths" 把它分成m份, 并且每一
     份在时间上是连续的.

思路:
         1.  暴力搜索.  (超时 T.T )
         2.  网上搜索下结果,发现二分法求解.
         3.  二分法思路:  
                           (1). 先确定二分的上界 和 下界.   (  n(max)   ~~~ ∑n(i) )
                           (2). 开始二分夹逼  (判断界限的条件是: 是否满足分块为m) .

AC代码:

#include <iostream>
#include <cstdio>
using namespace std;
#define MAX 100010

int n , m;
int a[MAX];

void find(int &left,int &right)
{
    left = 0;
    right = 0;
    int i ;
    for(i = 0; i < n; ++i)
    {
        if(left < a[i])
            left = a[i];
        right += a[i];
    }
}

int legalPartition(int ans)
{
    int part = 0;
    int i ;
    int k = 0;
    for(i = 0; i < n; ++i)
    {
        if(part + a[i] > ans)
        {
            part = a[i];
            ++k;
        }
        else
        {
            part += a[i];
        }
    }
    k++;
    if(k > m) return 0;
    else return 1;
}

int result(int &left,int &right)
{
    int mid = 0;
    while(left < right)
    {
        mid = (right + left) / 2;
        if( legalPartition(mid) == 0 )
            left = mid + 1;
        else
            right = mid;
    }
    
    return left;
}

int main()
{
    while(cin >> n >> m)
    {
        int left , right;
        int i , j;
        for(i = 0; i < n; ++i)
        {
            cin >> a[i];
        }
        find(left,right);
        cout << result(left,right) << endl;
    }
    
    return 0;
}