Pagini recente » Cod sursa (job #2665049) | Cod sursa (job #966975) | info-arena 2.0 | Cod sursa (job #2095007) | Cod sursa (job #1140261)
#include <fstream>
using namespace std;
const int NMAX=16000;
int main()
{
int n,k,i,V[NMAX], st=-1, dr=0,mid,nrt=0,s=0,sz=0;
fstream f("transport.in",ios::in),g("transport.out",ios::out);
f>>n>>k;
for(i=1;i<=n;++i)
{
f>>V[i];
dr+=V[i];
st=max(V[i],st);
}
f.close();
while(st<=dr)
{
mid=(st+dr)/2;
nrt=1;
s=0;
for(i=1;i<=n;++i)
{
if(s+V[i]<=mid) s+=V[i];
else
{
++nrt;
s=V[i];
}
}
if(nrt<=k)
{
sz=mid;
dr=mid-1;
}
else
{
st=mid+1;
}
}
g<<sz;
g.close();
}