题目的意思就是给出m个数 ,分成k组,只能连续的分成一组。问怎么分,这些分组中和的最大值最小。
思路就是通过二分枚举可能的最大值,一直二分,找到的最后一个,就是最小的最大值。。
然后遍历,连续和小于这个最大值,分一下。分完在从下一继续算连续和。。
#include<iostream>
#include<string.h>
using namespace std;
#define ll long long
const int N = 500 + 5;
ll pos[N];
int vis[N];
ll num,m,group;
bool is(int x) {
int k = 1;
ll sum = 0;
for (int i = 0 ;i < num ;i++) {
if (sum + pos[i] <= x)
sum += pos[i];
else {
sum = pos[i] ;
k++;
}
if (k > group)
return false;
}
return true;
}
void out() {
memset(vis , 0 ,sizeof(vis));
int k = 1 ;
ll sum = 0;
for (int i = num - 1 ; i >= 0 ;i--) {
if (sum + pos[i] <= m)
sum += pos[i];
else {
k++;
sum = pos[i];
vis[i] = 1;
}
}
for (int i = 0 ;i < num && k < group;i++) {
if (!vis[i]) {
vis[i] = 1;
k++;
}
}
for (int i = 0 ;i < num - 1 ;i++) {
cout << pos[i] << " ";
if (vis[i])
cout << "/ ";
}
cout << pos[num - 1]<<endl;;
}
int main () {
int Case;
cin >> Case;
while (Case--) {
ll sum = 0;
m = 0;
cin >> num >> group;
for (int i = 0 ; i < num ;i++) {
cin >> pos[i];
if (pos[i] > m)
m = pos[i];
sum += pos[i];
}
int mid;
while (sum > m) {
mid = (sum + m) / 2 ;
if (is(mid))
sum = mid;
else
m = mid + 1;
}
out();
}
}