Pagini recente » Cod sursa (job #2481849) | Cod sursa (job #1068638) | Cod sursa (job #2320020) | Cod sursa (job #2657210) | Cod sursa (job #2271824)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,k,i,a[16001],st,dr,mid,drumuri,vmax,vtotal,v,raspuns;
int main()
{
fin>>n>>k;
for(i=1; i<=n; i++)
{
fin>>a[i];
if(a[i]>vmax)vmax=a[i];
vtotal+=a[i];
}
st=vmax;
dr=vtotal;
while(st<=dr)
{
mid=(st+dr)/2;
v=0;
i=1;
drumuri=1;
while(i<=n)
{
if(v+a[i]<=mid)
v+=a[i];
else
{
v=a[i];
drumuri++;
}
i++;
}
if(drumuri>k)
st=mid+1;
else if(drumuri<=k)
{dr=mid-1;raspuns=mid;}
}
fout<<raspuns;
return 0;
}