Cod sursa(job #2064166)
Utilizator | Dobre Bogdan Mihai dobrebogdan | Data | 11 noiembrie 2017 21:28:35 |
---|---|---|---|
Problema | Transport | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.82 kb |
#include<cstdio>
const int nmax=16000;
int ve[nmax+5];
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int i,n,k,st,dr,mi,la,nt,cur;
scanf("%d%d",&n,&k);
st=1;
dr=nmax*nmax;
for(i=1;i<=n;i++)
{
scanf("%d",&ve[i]);
if(ve[i]>st)
st=ve[i];
}
while(st<=dr)
{
mi=(st+dr)/2;
cur=0;
nt=1;
for(i=1;i<=n;i++)
{
if(cur+ve[i]>mi)
{
cur=ve[i];
nt++;
}
else
cur=cur+ve[i];
}
if(nt<=k)
{
la=mi;
dr=mi-1;
}
else
{
st=mi+1;
}
}
printf("%d\n",la);
return 0;
}