Pagini recente » Atasamentele paginii probleme_de_oni-runda2019 | Cod sursa (job #3154883) | Istoria paginii runda/1321 | Rating Alexandru Diaconu Codrut (Alex_D2019) | Cod sursa (job #2382853)
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,k,i,dr=0,st=0,v[16001],mij,s,t,nr;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
dr=dr+v[i];
if(v[i]>st)
st=v[i];
}
while(st<=dr)
{
mij=(st+dr)/2;
s=0;
t=1;
for(i=1;i<=n;i++)
if(s+v[i]>mij)
{
t++;
s=v[i];
}
else
s=s+v[i];
if(t>k)
st=mij+1;
else
{
dr=mij-1;
nr=mij;
}
}
cout<<nr;
return 0;
}