Pagini recente » Cod sursa (job #782239) | Cod sursa (job #909272) | Cod sursa (job #2366000) | Borderou de evaluare (job #308099) | Cod sursa (job #2117081)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,nr,k,s,i,Max,x,st,dr,mij,sum,v[16001],sol;
int main()
{
fin>>n>>nr;
Max=0;
for(i=1;i<=n;i++){
fin>>x;
s=s+x;
v[i]=x;
Max=max(Max,x);
}
st=Max;
dr=s;
while(st<=dr){
mij=(st+dr)/2;
sum=0;
k=1;
for(i=1;i<=n;i++){
if(sum+v[i]<=mij)
sum=sum+v[i];
else{
k++;
sum=v[i];
}
}
if(k>nr)
st=mij+1;
else{
sol=mij;
dr=mij-1;
}
}
fout<<sol;
return 0;
}