难度:3
最小化最大值,注意的是判断函数里面多加了一个语句,这个东西李煜东的书上没加,但是数据可能考察到,不能省去,就是如果当前要判断的这个值就小于数组里面的单个元素,那么直接返回否。
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
const int N = 100005;
int n, m;
int a[N];
bool judge(int x) {
int cnt = 1, last = x;
for (int i = 0; i < n; i++) {
if (x < a[i]) return false;
if (last >= a[i]) {
last -= a[i];
} else {
cnt++;
last = x - a[i];
}
}
return cnt <= m;
}
void solve(int l, int r) {
while (l < r) {
int mid = (l + r) >> 1;
if (judge(mid)) r = mid;
else l = mid + 1;
}
cout << l;
}
int main() {
cin >> n >> m;
int sum = 0, Min = 10000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
Min = min(Min, a[i]);
}
solve(Min, sum);
return 0;
}