Pagini recente » Cod sursa (job #394196) | Cod sursa (job #2723895) | Cod sursa (job #2752229) | Cod sursa (job #2428497) | Cod sursa (job #1483783)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,i,v[16001],st,dr,s,capa,m,x;
int main()
{
f>>n>>k;
for(i=1; i<=n; i++)
{
f>>v[i];
dr=dr+v[i];
if(v[i]>st)
st=v[i];
}
dr++;
while(st<=dr)
{
m=(st+dr)/2;
x=1;
s=0;
for(i=0; i<n;)
{
if(s+v[i+1]<=m)
s=s+v[++i];
else
{
s=0;
x++;
}
}
if(x<=k)
{
capa=m;
dr=m-1;
}
else
{
st=mij+1;
}
}
g<<capa;
return 0;
}