POJ--2431--Expedition

题目描述：
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.
输入描述:
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
输出描述:
Line 1: The smallest possible monthly limit Farmer John can afford to live with.
输入：
7 5
100
400
300
100
500
101
400
输出：
500
题意：
给你一个长度为N的序列，现在要让你把他们切割成M份（所以每一份都是连续的），然后每一份都有一个和sum[i]，其中最大的一个是maxSum = max(sum[i]),问这个最大值最小是多少？
题解：
最大化最小值
二分
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int inf = 1 <