Pagini recente » Cod sursa (job #185789) | Cod sursa (job #1589863) | Cod sursa (job #221433) | Cod sursa (job #1763976) | Cod sursa (job #2861552)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001];
int main()
{
int n,k,s=0, max=0, afi=0, mij=0,st=0, dr=0,nr=0,i;
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
s+=v[i];
if(v[i]>max) max=v[i];
}
st=max;
dr=s;
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;
else{
dr=mij-1;
afi=mij;
}
}
fout<<afi;
return 0;
}