Pagini recente » Cod sursa (job #2527966) | Cod sursa (job #1257884) | Cod sursa (job #673768) | Cod sursa (job #1154706) | Cod sursa (job #2807624)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001];
int main()
{
int n, k, i, st=0, dr=0, mij, nrdrumuri, s, sol;
fin >> n >> k;
for (i = 1;i <= n;i++)
{
fin >> v[i];
if (v[i] > st)
st = v[i];
dr = dr + v[i];
}
while (st <= dr)
{
mij = (st + dr) / 2;
nrdrumuri = 0;
s = 0;
for (i = 1;nrdrumuri <= k && i <= n;i++)
{
if (v[i] + s > mij)
{
nrdrumuri++;
s = 0;
}
s = s + v[i];
}
if (nrdrumuri + 1 > k)
st = mij + 1;
else
{
sol = mij;
dr = mij - 1;
}
}
fout << sol;
}