Pagini recente » Cod sursa (job #2719272) | Cod sursa (job #713924) | Cod sursa (job #1914834) | Cod sursa (job #1590281) | Cod sursa (job #1259345)
#include <fstream>
#include <stdlib.h>
using namespace std;
int n,k,v[16000],st,dr,l2,l,drum,s;
bool t;
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];
st=max(v[i],st);
}
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(t==1&&l2==1+l)
{
fout<<l2;
exit (EXIT_SUCCESS);
}
l2=l;
t=0;
bin((cs+cd)/2,cd);
}
}
}
if(t==0&&l-l2==1)
{
fout<<l<<" ";
exit(EXIT_SUCCESS);
}
t=1;
l2=l;
bin(cs,(cd+cs)/2);
}