最小值最大化
有序列{2,2,3,4,5,1},划分为3个连续的子序列,子序列的和最大值最小
如(2,2,3),(4),(5,1)最大值最小为7
用二分法记录最大的值和在序列中最大的值3,而最大值最小一定在这里面。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
int n, m;
int a[maxn];
int check(int x) {
int cnt = 1;
int s = a[1];
for (int i = 2; i <= n; i++) {
if (s + a[i] <= x) s += a[i];
else { s = a[i]; cnt++; }
}
return cnt;
}
int bin_search(int l, int r) {
while (l < r) {
int mid = l + (r - l) / 2;
if (check(mid) <= m) {
r = mid;
}
else {
l = mid + 1;
}
}
return l;
}
int main() {
int t;
ll mx, sum;
cin >> t;
while (t--) {
mx = 0, sum = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
if (mx < a[i])
mx = a[i];
}
int ans = bin_search(mx, sum);
cout << ans;
}
return 0;
}