Pagini recente » Borderou de evaluare (job #2100033) | Cod sursa (job #2011888) | Cod sursa (job #2606605)
#include <cstdio>
using namespace std;
FILE *fin=fopen("transport.in","r");
FILE *fout=fopen("transport.out","w");
int v[16001];
int main()
{
int poz,st=0,dr=0,n,i,mij,nr,k,s;
fscanf(fin,"%d%d",&n,&k);
for(i=1;i<=n;i++)
{
fscanf(fin,"%d",&v[i]);
dr+=v[i];
if(v[i]>st)
st=v[i];
}
while(st<=dr)
{
mij=(st+dr)/2;
for(i=1,nr=0,s=0;i<=n&&nr<k;i++)
{
s=s+v[i];
if(s>mij)
{
nr++;
s=v[i];
}
}
nr++;
if(nr<=k)
{
poz=mij;
dr=mij-1;
}
else
st=mij+1;
}
fprintf(fout,"%d",poz);
return 0;
}