Pagini recente » Cod sursa (job #3229520) | Cod sursa (job #3289178) | Cod sursa (job #1651458) | Cod sursa (job #3148108) | Cod sursa (job #2295622)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, saltele[16001], maxim, s;
void citire()
{
fin >> n >> k;
for (int i = 0; i < n; ++i)
{
fin >> saltele[i];
s += saltele[i];
if (saltele[i] > maxim)
maxim = saltele[i];
}
}
bool gasit(int x)
{
int c = 1, suma = 0;
for (int i = 0; i < n; ++i)
{
suma += saltele[i];
if (suma > x)
{
suma = saltele[i];
++c;
}
}
if (c <= k)
return true;
return false;
}
int cautare_binara()
{
int st = maxim, dr = s;
while (st < dr)
{
int m = (st + dr) / 2;
if (gasit(m))
dr = m;
else
st = m + 1;
}
return st;
}
int main()
{
citire();
fout << cautare_binara();
return 0;
}