#include<stdio.h>
int mon[100005];
int main() {
int n,m,sum,maxn,i;
while (scanf ("%d %d",&n,&m)!=EOF) {
sum=0;
maxn=0;
for (i=0; i<n; i++) {
scanf ("%d",&mon[i]);
sum+=mon[i]; //上限 分成一个堆
if (mon[i]>maxn) maxn=mon[i]; //下限 分成n个堆
}
while (maxn<sum) {
int count=0;
int mid=(maxn+sum)/2;
int ss=0;
for (i=0; i<n; i++) {
ss+=mon[i];
if (ss>mid) { //分堆
ss=mon[i];
count++; //分堆数
}
}
if (count<m) sum=mid; //判读分堆过多或过少
else maxn=mid+1;
}
printf ("%d\n",maxn);
}
return 0;
int mon[100005];
int main() {
int n,m,sum,maxn,i;
while (scanf ("%d %d",&n,&m)!=EOF) {
sum=0;
maxn=0;
for (i=0; i<n; i++) {
scanf ("%d",&mon[i]);
sum+=mon[i]; //上限 分成一个堆
if (mon[i]>maxn) maxn=mon[i]; //下限 分成n个堆
}
while (maxn<sum) {
int count=0;
int mid=(maxn+sum)/2;
int ss=0;
for (i=0; i<n; i++) {
ss+=mon[i];
if (ss>mid) { //分堆
ss=mon[i];
count++; //分堆数
}
}
if (count<m) sum=mid; //判读分堆过多或过少
else maxn=mid+1;
}
printf ("%d\n",maxn);
}
return 0;
}
二分查找注意上限和下限确定 以及结束条件