#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
const int size = 500 + 5;
int n, k, a[size];
bool is[size];
int is_p(ll num)
{
ll tot = 0;
int cur_k = 1;
for(int i = 0; i < n; i++){
if(tot + a[i] <= num) tot += a[i];
else{
tot = a[i];
cur_k++;
}
}
return cur_k;
}
void print(ll num)
{
int rk = k - 1;
ll tot = 0;
memset(is, 0, sizeof(is));
for(int i = n - 1; i >= 0; i--){
if(tot + a[i] > num || i < rk){
tot = a[i];
is[i] = 1;
rk--;
}
else tot += a[i];
}
for(int i = 0; i < n-1; i++){
printf("%d ", a[i]);
if(is[i]) printf("/ ");
}
printf("%d\n", a[n-1]);
}
int main()
{
scanf("%d%d", &n, &k);
int maxa = 0;
ll sum = 0;
for(int i = 0; i < n; i++){
scanf("%d", &a[i]);
maxa = max(maxa, a[i]);
sum += a[i];
}
ll l = (ll)maxa, r = sum;
while(l < r){
ll m = (l + r) / 2;
if(is_p(m) <= k) r = m;
else l = m + 1;
}
print(l);
return 0;
}
把一个包含m个正整数的序列划分成k个(1≤k≤m≤500)非空的连续子序列,使得每个正整数恰好属于一个序列。设第i个序列的各数之和为S(i),你的任务是让所有S(i)的最大值尽量小。例如,序列1 2
最新推荐文章于 2023-08-20 12:00:55 发布