Pagini recente » Cod sursa (job #1452005) | Cod sursa (job #2236412) | Cod sursa (job #249252) | Cod sursa (job #377969) | Cod sursa (job #2781182)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n,k,a[16002];
const int NMAX=256000000;
bool valid(int x)
{
int s=0,nr=0;
for (int i=1;i<=n;i++)
{
if (a[i]>x) return 0;
while(s+a[i]<=x && i<=n)
{
s+=a[i];
i++;
}
i--;
nr++;
s=0;
}
if (nr<=k) return 1;
return 0;
}
int main()
{
fin>>n>>k;
for (int i=1;i<=n;++i)
{
fin>>a[i];
}
int rmin=NMAX+1;
int lf=1,rg=NMAX,mij;
while (lf<=rg)
{
mij=(rg+lf)/2;
if (valid(mij)==1)
{
if (mij<rmin)
rmin=mij;
rg=mij-1;
}
else if (valid(mij)==0)
{
lf=mij+1;
}
}
fout<<rmin;
}