Pagini recente » Cod sursa (job #100788) | Cod sursa (job #2354545) | Cod sursa (job #890564) | Cod sursa (job #1765482) | Cod sursa (job #1143264)
#include <cstdio>
using namespace std;
int s[16016];
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,k,i,st,ans,dr,maxi=0,r,rasp,x;
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i){
scanf("%d",&x);
if(x>maxi) maxi=x;
s[i]=s[i-1]+x;
}
int ok=0;
for(r=maxi;r<=s[n] && ok==0;++r){
int mis=0,poz=1;
while(poz<=n){
st=poz;
dr=n;
ans=-1;
while(st<=dr){
int mij=(st+dr)/2;
if(s[mij]<=r){
st=mij+1;
ans=mij;
}
else
dr=mij-1;
}
++mis;
for(i=ans+1;i<=n;++i) s[i]=s[i]-s[ans];
poz=ans+1;
}
if(mis<=k) ok=1;
}
printf("%d\n",r);
return 0;
}