Pagini recente » Cod sursa (job #1478170) | Cod sursa (job #2685974) | Cod sursa (job #1515529) | Cod sursa (job #207598) | Cod sursa (job #1574687)
#include <fstream>
using namespace std;
long long n, k, i, st, dr, mij, v[16003], s, nr;
int main()
{
ifstream fin("transport.in");
ofstream fout("transport.out");
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
st=1;
dr=256000000;
while(st<=dr){
mij=(st+dr)/2;
for(i=1;i<=n;i++){
s+=v[i];
if(s>mij){
nr++;
s=v[i];
}
}
if(nr>k)
st=mij+1;
else
dr=mij-1;
nr=0;
}
fout<<st;
return 0;
}