Pagini recente » Borderou de evaluare (job #321567) | Cod sursa (job #2221604) | Cod sursa (job #1913355) | Cod sursa (job #1778317) | Cod sursa (job #2780415)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,k,a[16001];
bool valid(int x)
{
bool ok;
int s=0,nr=0;
for (int i=1;i<=n;i++)
{
while(s+a[i]<x && i<=n)
{
s+=a[i];
i++;
}
nr++;
/// fout<<s<<" ";
s=a[i];
if (a[i]>=x) return 0;
}
if (nr<=k) return 1;
return 0;
}
int main()
{
fin>>n>>k;
for (int i=1;i<=n;++i)
{
fin>>a[i];
}
int r,rmin=16001;
int lf=1,rg=16000,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;
}