Pagini recente » Cod sursa (job #1218449) | Cod sursa (job #2907274) | Cod sursa (job #1157819) | Cod sursa (job #2536340) | Cod sursa (job #1243361)
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,a[16005],i,s;
bool sum(int val)
{
int nr=0,s=0;
for(i=1; i<=n; ++i)
{
if(a[i]>val)
return false;
else
{
if(s+a[i]>val)
{
nr++;
s=a[i];
}
else s+=a[i];
}
}
if(s>0)
nr++;
if(nr<=k)
return true;
else return false;
}
int transp()
{
int st=1, dr=s;
int mij,x;
while(st<=dr)
{
mij=(st+dr)>>1;
if(sum(mij)) {dr=mij-1;x=mij;}
else st=mij+1;
}
return x;
}
int main()
{
f>>n>>k;
s=0;
for(i=1; i<=n; ++i)
{
f>>a[i];
s+=a[i];
}
g<<transp();
return 0;
}