Pagini recente » Cod sursa (job #994187) | Cod sursa (job #14572) | Cod sursa (job #1382706) | Cod sursa (job #2634905) | Cod sursa (job #2801949)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16001];
int main()
{
int max=0,s=0,n,i,aux,st,dr,mij,nr1,k,nr,afi;
cin>>n>>k;
for(i=1;i<=n;i++){
cin>>v[i];
s+=v[i];
if(max<v[i])
max=v[i];
}
st=max;
dr=s;
s=0;
while(st<=dr){
mij=(st+dr)/2;
s=mij;
nr=0;
for(i=1;i<=n;i++){
if(s-v[i]<0){
s=mij;
nr++;
}
s-=v[i];
}
nr++;
if(nr>k)
st=mij+1;
if(nr==k){
afi=mij;
dr=mij-1;
}
else
if(nr<k)
dr=mij-1;
}
cout<<afi;
return 0;
}