Pagini recente » Cod sursa (job #3036465) | Cod sursa (job #903305) | Cod sursa (job #3161275) | Cod sursa (job #2135625) | Cod sursa (job #1378173)
#include<fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001],n;
int f(int x)
{
int i,aux=x,t=1;
for(i=1;i<=n;i++)
{
if(v[i]<=aux)
{
aux=aux-v[i];
}
else
{
aux=x;
aux=aux-v[i];
t++;
}
}
return t;
}
int main()
{
int i,k,maxim=0,s=0,l,r,sol=0,mid;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
{
if(v[i]>maxim)
maxim=v[i];
s+=v[i];
}
l=maxim;
r=s;
while(l<=r)
{
mid=(l+r)/2;
if(f(mid)<=k)
{
sol=mid;
r=mid-1;
}
else
{
l=mid+1;
}
}
fout<<sol<<"\n";
return 0;
}