#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,r,l,s,ans,a[N],k;
bool judge(int mid)
{
int s=0,num=1;
for (int i=1;i<=n;i++)
{
if(s+a[i]<=mid) s+=a[i];
else s=a[i],num++;
}
return num<=k;
}
int main()
{
ios::sync_with_stdio(false);
cin>>n>>k;
for (int i=1;i<=n;i++)
{
cin>>a[i];
r+=a[i];
l=max(l,a[i]);
}
while (l<=r)
{
int m=l+(m-l)/2;
if(judge(m)) ans=m,r=m-1;
else l=m+1;
}
printf("%d\n",ans);
return 0;
}
数列分段(模板)
最新推荐文章于 2021-01-03 16:11:39 发布