Pagini recente » Cod sursa (job #1814330) | Cod sursa (job #3213203) | Cod sursa (job #1695199) | Cod sursa (job #2941968) | Cod sursa (job #1306817)
#include <fstream>
using namespace std;
int n,k,v[16000],st,dr,l,drum,s;
void bin(int cs,int cd);
ifstream fin ("transport.in");
ofstream fout("transport.out");
int main ()
{
fin>>n>>k;
for(int i=0; i<n; ++i)
{
fin>>v[i];
dr+=v[i];
if(v[i]>st)st=v[i];
}
bin(st,dr);
}
void bin(int cs, int cd)
{
s=v[0];
drum=1;
l=(cs+cd)/2;
for(int i=1; i<n; ++i)
{
if(v[i]+s<=l)s+=v[i];
else
{
drum++;
s=v[i];
if(drum>k)
{
if(cs==cd)
{
fout<<cs<<" ";
return;
}
bin((cs+cd)/2+1,cd);
}
}
}
if(cs==cd)
{
fout<<cs;
return;
}
bin(cs,(cd+cs)/2);
}