Pagini recente » Cod sursa (job #1837386) | Cod sursa (job #2013022) | Cod sursa (job #75872) | Cod sursa (job #1565914) | Cod sursa (job #732556)
Cod sursa(job #732556)
#include<cstdio>
using namespace std;
long long int a,c,d,v[16009],k,m,n,l,i=1,p=0,j=0,x=1,me=0,s=0,y=16000;
int lol(long long int me){
int b=0,i=1;
while(v[i]!=0){
while(s<me && v[i]!=0){
s=v[i]+s;
i++;
}
if(s>me){i--;
s-=v[i];
}
b++;s=0;
}
return b;}
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%lld %lld",&n,&k);
for(l=1;l<=n;l++)
scanf("%lld",&v[l]);
while(x<=y){
me=(x+y)/2;
j=lol(me);
if(j<=k)
p=me;
if(j>k)
x=me+1;
else
y=me-1;
j=0;i=1;
}
printf("%lld",p);
return 0;
}