题目 链接
思路简析
尽可能地把数字分在一组里,但是不能超过check的值,二分的特征之一是 == 最大的值最小 == ,其次发现x,x+1,x+2,...,x+n都是有效的,找到最左边的有效值。
参考代码
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
ll a[N];
ll n, m;
ll check(ll x) {
ll cnt = 0;
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (sum > x) {
cnt++;
ll d = sum -= a[i];
if (d > x) return false;
sum = a[i];
}
}
if (sum) cnt++;
if (cnt > m) return false;
return true;
}
int main() {
// freopen("in.txt", "r", stdin);
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
ll l = 0, r = 0;
for (int i = 0; i < n; i++) r += a[i];
// for (int i = l; i < r; i++) cout << i << " " << check(i) << endl;
while (l < r) {
ll mid = l + r >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
cout << l << endl;
return 0;
}