Pagini recente » Cod sursa (job #1274612) | Istoria paginii runda/primuld | Cod sursa (job #894958) | Cod sursa (job #1932214) | Cod sursa (job #1599725)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("transport.in");
ofstream o("transport.out");
long int i,s,t,st,dr,mij,n,k,v[16005],min;
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
st=1;
dr=10;
while(st<=dr)
{
mij=(st+dr)/2;
t=0;
s=0;
for(i=1;i<=n;i++)
{
if(v[i]+s<=mij)
{
s=s+v[i];
}
else
{
t++;
s=v[i];
}
}
t++;
if(t>k)
{
st=mij+1;
}
else
{
min=mij;
dr=mij-1;
}
}
o<<min;
return 0;
}