POJ 3273 每日费用 二分

#include<bits/stdc++.h>
using namespace std;
const int MX = 1e5 + 10;
int n, m;
int l, r, mid;
int a[MX];
bool func()
{
		mid = (l + r) / 2;
		int sum = 0;
		int cnt = 1;
		for(int i = 1; i <= n; i++)
		{
			if(sum + a[i] <= mid)
			{
				sum += a[i];
			}
			else
			{
				sum = a[i];
				cnt++;
			}
		}
		if(cnt > m) return false;
		return 1;
}
int main()
{
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
		l = max(l, a[i]);
		r += a[i];
	}
	while(l <= r)
	{
		if(!func())
		{
			l = mid + 1;
		}
		else{
			r = mid - 1;
		}
	}
	cout << mid << endl;
	return 0;
}