Pagini recente » Cod sursa (job #2138503) | Cod sursa (job #897734) | Cod sursa (job #1687995) | Cod sursa (job #1947760) | Cod sursa (job #2209625)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,suma,k,a[16001],maxim;
void citire()
{
cin>>n>>k;
for(int i=1;i<=n;++i)
{ cin>>a[i];
suma+=a[i];
maxim=max(a[i],maxim);
}
}
int cautare(int s,int d)
{int minim=0;
while(s<=d)
{
int m=(s+d)/2;
int sum=0,ct=0;
for(int i=1;i<=n;++i)
{
sum+=a[i];
if(sum>m)
{++ct;
sum=a[i];
}
else
if(sum==m)
++ct,sum=0;
if(ct>k)break;
}
if(sum>0)++ct;
if(ct<=k)
{
d=m-1;
minim=m;
}
else s=m+1;
}
return minim;
}
int main()
{
citire();
cout<<cautare(maxim,suma);
return 0;
}