Pagini recente » Cod sursa (job #195173) | Cod sursa (job #972727) | Cod sursa (job #2605962) | Cod sursa (job #3229955) | Cod sursa (job #1664623)
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,k,v[16001],i,p,pr,c,j,s;
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
p=0;
i=v[1];
while(p!=1){
c=0;
j=1;
while(j<=n){
pr=0;
s=0;
while(pr!=1){
s=s+v[j];
if(s+v[j+1]>i){
pr++;
j++;
}
else
j++;
}
c++;
}
if(c>k){
i--;
p++;
}
if(c<=k)
p++;
else
i=i+2;
}
cout<<i;
return 0;
}